./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a697edfe042240cd4f596c03e6214ca7451405ac ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:28:57,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:28:57,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:28:57,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:28:57,861 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:28:57,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:28:57,862 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:28:57,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:28:57,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:28:57,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:28:57,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:28:57,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:28:57,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:28:57,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:28:57,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:28:57,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:28:57,867 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:28:57,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:28:57,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:28:57,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:28:57,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:28:57,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:28:57,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:28:57,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:28:57,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:28:57,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:28:57,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:28:57,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:28:57,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:28:57,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:28:57,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:28:57,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:28:57,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:28:57,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:28:57,876 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:28:57,876 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:28:57,876 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:28:57,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:28:57,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:28:57,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:28:57,884 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:28:57,884 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:28:57,884 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:28:57,884 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:28:57,884 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:28:57,884 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:28:57,885 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:28:57,885 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:28:57,885 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:28:57,885 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:28:57,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:28:57,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:28:57,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:28:57,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:28:57,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:28:57,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:28:57,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:28:57,886 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:28:57,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:28:57,887 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:28:57,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:28:57,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:28:57,887 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:28:57,887 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a697edfe042240cd4f596c03e6214ca7451405ac [2018-12-09 09:28:57,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:28:57,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:28:57,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:28:57,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:28:57,913 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:28:57,914 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i [2018-12-09 09:28:57,948 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/data/ba2437025/1285976e3a274070a020603ab3f16f2a/FLAGd3815f6ef [2018-12-09 09:28:58,404 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:28:58,404 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/sv-benchmarks/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i [2018-12-09 09:28:58,412 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/data/ba2437025/1285976e3a274070a020603ab3f16f2a/FLAGd3815f6ef [2018-12-09 09:28:58,421 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/data/ba2437025/1285976e3a274070a020603ab3f16f2a [2018-12-09 09:28:58,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:28:58,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:28:58,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:28:58,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:28:58,426 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:28:58,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58, skipping insertion in model container [2018-12-09 09:28:58,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:28:58,453 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:28:58,626 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:28:58,634 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:28:58,709 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:28:58,738 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:28:58,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58 WrapperNode [2018-12-09 09:28:58,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:28:58,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:28:58,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:28:58,739 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:28:58,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:28:58,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:28:58,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:28:58,774 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:28:58,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... [2018-12-09 09:28:58,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:28:58,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:28:58,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:28:58,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:28:58,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:28:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:28:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:28:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 09:28:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:28:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 09:28:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 09:28:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 09:28:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 09:28:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 09:28:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:28:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:28:58,832 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 09:28:59,159 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:28:59,159 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 09:28:59,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:28:59 BoogieIcfgContainer [2018-12-09 09:28:59,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:28:59,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:28:59,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:28:59,163 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:28:59,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:28:58" (1/3) ... [2018-12-09 09:28:59,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a58ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:28:59, skipping insertion in model container [2018-12-09 09:28:59,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:58" (2/3) ... [2018-12-09 09:28:59,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a58ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:28:59, skipping insertion in model container [2018-12-09 09:28:59,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:28:59" (3/3) ... [2018-12-09 09:28:59,165 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc_false-unreach-call.i [2018-12-09 09:28:59,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:59,202 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 09:28:59,202 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:28:59,207 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 09:28:59,217 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 09:28:59,232 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:28:59,232 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:28:59,232 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:28:59,232 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:28:59,232 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:28:59,232 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:28:59,232 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:28:59,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:28:59,239 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-09 09:29:00,101 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2018-12-09 09:29:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2018-12-09 09:29:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 09:29:00,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:00,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:00,109 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:00,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2018-12-09 09:29:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:00,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:00,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:00,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:00,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:00,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:00,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:00,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:00,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:00,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:00,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:00,267 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2018-12-09 09:29:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:00,652 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2018-12-09 09:29:00,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:29:00,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-09 09:29:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:00,790 INFO L225 Difference]: With dead ends: 45394 [2018-12-09 09:29:00,790 INFO L226 Difference]: Without dead ends: 40634 [2018-12-09 09:29:00,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2018-12-09 09:29:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2018-12-09 09:29:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2018-12-09 09:29:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2018-12-09 09:29:01,465 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2018-12-09 09:29:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:01,465 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2018-12-09 09:29:01,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2018-12-09 09:29:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:29:01,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:01,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:01,469 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:01,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2018-12-09 09:29:01,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:01,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:01,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:01,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:01,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:01,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:01,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:01,522 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2018-12-09 09:29:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:02,117 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2018-12-09 09:29:02,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:02,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-09 09:29:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:02,256 INFO L225 Difference]: With dead ends: 64836 [2018-12-09 09:29:02,256 INFO L226 Difference]: Without dead ends: 64676 [2018-12-09 09:29:02,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2018-12-09 09:29:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2018-12-09 09:29:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2018-12-09 09:29:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2018-12-09 09:29:03,059 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2018-12-09 09:29:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:03,060 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2018-12-09 09:29:03,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2018-12-09 09:29:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 09:29:03,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:03,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:03,062 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:03,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2018-12-09 09:29:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:03,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:03,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:03,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:03,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:03,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:03,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:03,098 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2018-12-09 09:29:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:03,145 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2018-12-09 09:29:03,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:03,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 09:29:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:03,160 INFO L225 Difference]: With dead ends: 12370 [2018-12-09 09:29:03,160 INFO L226 Difference]: Without dead ends: 11849 [2018-12-09 09:29:03,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2018-12-09 09:29:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2018-12-09 09:29:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2018-12-09 09:29:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2018-12-09 09:29:03,384 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2018-12-09 09:29:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:03,384 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2018-12-09 09:29:03,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2018-12-09 09:29:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:29:03,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:03,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:03,387 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:03,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2018-12-09 09:29:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:03,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:03,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:03,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:03,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:03,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:03,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:03,458 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2018-12-09 09:29:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:03,610 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2018-12-09 09:29:03,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:03,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 09:29:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:03,630 INFO L225 Difference]: With dead ends: 17025 [2018-12-09 09:29:03,631 INFO L226 Difference]: Without dead ends: 17025 [2018-12-09 09:29:03,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2018-12-09 09:29:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2018-12-09 09:29:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2018-12-09 09:29:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2018-12-09 09:29:03,786 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2018-12-09 09:29:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:03,786 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2018-12-09 09:29:03,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2018-12-09 09:29:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:29:03,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:03,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:03,790 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:03,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:03,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2018-12-09 09:29:03,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:03,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:03,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:03,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:03,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:03,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:03,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:03,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:03,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:03,830 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2018-12-09 09:29:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:04,188 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2018-12-09 09:29:04,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:04,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 09:29:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:04,211 INFO L225 Difference]: With dead ends: 18380 [2018-12-09 09:29:04,211 INFO L226 Difference]: Without dead ends: 18380 [2018-12-09 09:29:04,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-09 09:29:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2018-12-09 09:29:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2018-12-09 09:29:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2018-12-09 09:29:04,403 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2018-12-09 09:29:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:04,403 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2018-12-09 09:29:04,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2018-12-09 09:29:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:29:04,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:04,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:04,408 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:04,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:04,408 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2018-12-09 09:29:04,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:04,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:04,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:04,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:04,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:04,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:04,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:04,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:04,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:04,510 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2018-12-09 09:29:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:04,768 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2018-12-09 09:29:04,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:04,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 09:29:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:04,788 INFO L225 Difference]: With dead ends: 17857 [2018-12-09 09:29:04,788 INFO L226 Difference]: Without dead ends: 17857 [2018-12-09 09:29:04,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2018-12-09 09:29:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2018-12-09 09:29:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2018-12-09 09:29:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2018-12-09 09:29:05,011 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2018-12-09 09:29:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:05,012 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2018-12-09 09:29:05,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2018-12-09 09:29:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:29:05,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:05,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:05,015 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:05,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:05,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2018-12-09 09:29:05,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:05,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:05,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:05,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:05,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:05,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:05,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:05,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:05,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:05,047 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2018-12-09 09:29:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:05,376 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2018-12-09 09:29:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:29:05,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 09:29:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:05,402 INFO L225 Difference]: With dead ends: 23475 [2018-12-09 09:29:05,403 INFO L226 Difference]: Without dead ends: 23443 [2018-12-09 09:29:05,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:29:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2018-12-09 09:29:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2018-12-09 09:29:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2018-12-09 09:29:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2018-12-09 09:29:05,617 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2018-12-09 09:29:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:05,618 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2018-12-09 09:29:05,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2018-12-09 09:29:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 09:29:05,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:05,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:05,629 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:05,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2018-12-09 09:29:05,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:05,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:05,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:05,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:05,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:05,690 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2018-12-09 09:29:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:06,136 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2018-12-09 09:29:06,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:29:06,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-09 09:29:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:06,163 INFO L225 Difference]: With dead ends: 24535 [2018-12-09 09:29:06,163 INFO L226 Difference]: Without dead ends: 24471 [2018-12-09 09:29:06,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:29:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2018-12-09 09:29:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2018-12-09 09:29:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2018-12-09 09:29:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2018-12-09 09:29:06,460 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2018-12-09 09:29:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:06,460 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2018-12-09 09:29:06,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2018-12-09 09:29:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 09:29:06,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:06,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:06,473 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:06,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2018-12-09 09:29:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:06,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:06,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:29:06,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:06,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:29:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:29:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:29:06,505 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2018-12-09 09:29:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:06,586 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2018-12-09 09:29:06,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:29:06,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-09 09:29:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:06,614 INFO L225 Difference]: With dead ends: 24947 [2018-12-09 09:29:06,615 INFO L226 Difference]: Without dead ends: 24947 [2018-12-09 09:29:06,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:29:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2018-12-09 09:29:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2018-12-09 09:29:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2018-12-09 09:29:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2018-12-09 09:29:06,852 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2018-12-09 09:29:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:06,852 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2018-12-09 09:29:06,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:29:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2018-12-09 09:29:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 09:29:06,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:06,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:06,868 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:06,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2018-12-09 09:29:06,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:06,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:06,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:06,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:06,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:06,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:06,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:06,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:06,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:06,908 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2018-12-09 09:29:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:07,309 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2018-12-09 09:29:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:07,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 09:29:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:07,349 INFO L225 Difference]: With dead ends: 34667 [2018-12-09 09:29:07,349 INFO L226 Difference]: Without dead ends: 34471 [2018-12-09 09:29:07,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2018-12-09 09:29:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2018-12-09 09:29:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2018-12-09 09:29:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2018-12-09 09:29:07,705 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2018-12-09 09:29:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:07,705 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2018-12-09 09:29:07,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2018-12-09 09:29:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 09:29:07,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:07,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:07,725 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:07,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2018-12-09 09:29:07,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:07,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:07,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:07,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:07,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:07,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:07,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:07,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:07,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:07,797 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2018-12-09 09:29:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:08,293 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2018-12-09 09:29:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:29:08,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-12-09 09:29:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:08,365 INFO L225 Difference]: With dead ends: 52152 [2018-12-09 09:29:08,365 INFO L226 Difference]: Without dead ends: 51912 [2018-12-09 09:29:08,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:29:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2018-12-09 09:29:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2018-12-09 09:29:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2018-12-09 09:29:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2018-12-09 09:29:08,906 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2018-12-09 09:29:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:08,906 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2018-12-09 09:29:08,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2018-12-09 09:29:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 09:29:08,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:08,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:08,936 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:08,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2018-12-09 09:29:08,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:08,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:08,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:08,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:08,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:08,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:08,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:08,971 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2018-12-09 09:29:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:08,997 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2018-12-09 09:29:08,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:29:08,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-09 09:29:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:09,001 INFO L225 Difference]: With dead ends: 5456 [2018-12-09 09:29:09,001 INFO L226 Difference]: Without dead ends: 4832 [2018-12-09 09:29:09,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2018-12-09 09:29:09,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2018-12-09 09:29:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-12-09 09:29:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2018-12-09 09:29:09,036 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2018-12-09 09:29:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:09,036 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2018-12-09 09:29:09,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2018-12-09 09:29:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 09:29:09,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:09,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:09,040 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:09,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2018-12-09 09:29:09,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:09,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:09,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:09,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:09,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:09,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:09,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:09,105 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2018-12-09 09:29:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:09,233 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2018-12-09 09:29:09,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:09,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-09 09:29:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:09,237 INFO L225 Difference]: With dead ends: 5468 [2018-12-09 09:29:09,237 INFO L226 Difference]: Without dead ends: 5440 [2018-12-09 09:29:09,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-12-09 09:29:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2018-12-09 09:29:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-12-09 09:29:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2018-12-09 09:29:09,274 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2018-12-09 09:29:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:09,274 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2018-12-09 09:29:09,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2018-12-09 09:29:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 09:29:09,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:09,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:09,280 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:09,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash -282188276, now seen corresponding path program 1 times [2018-12-09 09:29:09,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:09,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:09,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:29:09,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:09,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:29:09,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:29:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:29:09,305 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2018-12-09 09:29:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:09,368 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2018-12-09 09:29:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:29:09,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-09 09:29:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:09,372 INFO L225 Difference]: With dead ends: 5440 [2018-12-09 09:29:09,372 INFO L226 Difference]: Without dead ends: 5440 [2018-12-09 09:29:09,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:29:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-12-09 09:29:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2018-12-09 09:29:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2018-12-09 09:29:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2018-12-09 09:29:09,409 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2018-12-09 09:29:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:09,409 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2018-12-09 09:29:09,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:29:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2018-12-09 09:29:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:09,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:09,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:09,413 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:09,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash -203880528, now seen corresponding path program 1 times [2018-12-09 09:29:09,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:09,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:09,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:09,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:09,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:09,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:09,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:09,446 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 4 states. [2018-12-09 09:29:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:09,523 INFO L93 Difference]: Finished difference Result 9734 states and 25760 transitions. [2018-12-09 09:29:09,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:29:09,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 09:29:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:09,530 INFO L225 Difference]: With dead ends: 9734 [2018-12-09 09:29:09,530 INFO L226 Difference]: Without dead ends: 9706 [2018-12-09 09:29:09,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2018-12-09 09:29:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 5140. [2018-12-09 09:29:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2018-12-09 09:29:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13376 transitions. [2018-12-09 09:29:09,581 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13376 transitions. Word has length 91 [2018-12-09 09:29:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:09,582 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13376 transitions. [2018-12-09 09:29:09,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13376 transitions. [2018-12-09 09:29:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:09,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:09,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:09,585 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:09,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1904621007, now seen corresponding path program 1 times [2018-12-09 09:29:09,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:09,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:09,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:09,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:09,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:09,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:09,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:09,650 INFO L87 Difference]: Start difference. First operand 5140 states and 13376 transitions. Second operand 6 states. [2018-12-09 09:29:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:09,822 INFO L93 Difference]: Finished difference Result 5643 states and 14543 transitions. [2018-12-09 09:29:09,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:29:09,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 09:29:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:09,826 INFO L225 Difference]: With dead ends: 5643 [2018-12-09 09:29:09,826 INFO L226 Difference]: Without dead ends: 5643 [2018-12-09 09:29:09,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2018-12-09 09:29:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5222. [2018-12-09 09:29:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2018-12-09 09:29:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 13576 transitions. [2018-12-09 09:29:09,864 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 13576 transitions. Word has length 91 [2018-12-09 09:29:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:09,864 INFO L480 AbstractCegarLoop]: Abstraction has 5222 states and 13576 transitions. [2018-12-09 09:29:09,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 13576 transitions. [2018-12-09 09:29:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:09,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:09,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:09,867 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:09,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:09,868 INFO L82 PathProgramCache]: Analyzing trace with hash -935039984, now seen corresponding path program 1 times [2018-12-09 09:29:09,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:09,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:09,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:09,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:09,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:09,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:09,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:09,934 INFO L87 Difference]: Start difference. First operand 5222 states and 13576 transitions. Second operand 7 states. [2018-12-09 09:29:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:10,128 INFO L93 Difference]: Finished difference Result 5203 states and 13406 transitions. [2018-12-09 09:29:10,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:29:10,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 09:29:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:10,132 INFO L225 Difference]: With dead ends: 5203 [2018-12-09 09:29:10,132 INFO L226 Difference]: Without dead ends: 5178 [2018-12-09 09:29:10,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:29:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2018-12-09 09:29:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4801. [2018-12-09 09:29:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2018-12-09 09:29:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 12542 transitions. [2018-12-09 09:29:10,165 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 12542 transitions. Word has length 91 [2018-12-09 09:29:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:10,165 INFO L480 AbstractCegarLoop]: Abstraction has 4801 states and 12542 transitions. [2018-12-09 09:29:10,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 12542 transitions. [2018-12-09 09:29:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:10,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:10,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:10,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:10,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:10,169 INFO L82 PathProgramCache]: Analyzing trace with hash -359042702, now seen corresponding path program 2 times [2018-12-09 09:29:10,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:10,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:10,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:10,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:10,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:10,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:10,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:10,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:10,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:10,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:10,240 INFO L87 Difference]: Start difference. First operand 4801 states and 12542 transitions. Second operand 7 states. [2018-12-09 09:29:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:10,379 INFO L93 Difference]: Finished difference Result 5254 states and 13455 transitions. [2018-12-09 09:29:10,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:29:10,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 09:29:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:10,383 INFO L225 Difference]: With dead ends: 5254 [2018-12-09 09:29:10,383 INFO L226 Difference]: Without dead ends: 5254 [2018-12-09 09:29:10,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:29:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2018-12-09 09:29:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5000. [2018-12-09 09:29:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5000 states. [2018-12-09 09:29:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 12931 transitions. [2018-12-09 09:29:10,422 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 12931 transitions. Word has length 91 [2018-12-09 09:29:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:10,423 INFO L480 AbstractCegarLoop]: Abstraction has 5000 states and 12931 transitions. [2018-12-09 09:29:10,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 12931 transitions. [2018-12-09 09:29:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:10,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:10,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:10,426 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:10,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash -234969455, now seen corresponding path program 1 times [2018-12-09 09:29:10,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:10,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:10,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:29:10,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:10,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:10,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:10,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:10,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:10,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:10,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:10,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:10,472 INFO L87 Difference]: Start difference. First operand 5000 states and 12931 transitions. Second operand 6 states. [2018-12-09 09:29:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:10,601 INFO L93 Difference]: Finished difference Result 4465 states and 11620 transitions. [2018-12-09 09:29:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:10,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 09:29:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:10,604 INFO L225 Difference]: With dead ends: 4465 [2018-12-09 09:29:10,605 INFO L226 Difference]: Without dead ends: 4465 [2018-12-09 09:29:10,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2018-12-09 09:29:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 4329. [2018-12-09 09:29:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4329 states. [2018-12-09 09:29:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 11320 transitions. [2018-12-09 09:29:10,633 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 11320 transitions. Word has length 91 [2018-12-09 09:29:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:10,633 INFO L480 AbstractCegarLoop]: Abstraction has 4329 states and 11320 transitions. [2018-12-09 09:29:10,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 11320 transitions. [2018-12-09 09:29:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:10,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:10,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:10,636 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:10,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:10,636 INFO L82 PathProgramCache]: Analyzing trace with hash -82841607, now seen corresponding path program 1 times [2018-12-09 09:29:10,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:10,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:10,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:10,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:10,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:10,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:10,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:10,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:10,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:10,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:10,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:10,689 INFO L87 Difference]: Start difference. First operand 4329 states and 11320 transitions. Second operand 6 states. [2018-12-09 09:29:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:10,836 INFO L93 Difference]: Finished difference Result 5842 states and 14969 transitions. [2018-12-09 09:29:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:10,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 09:29:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:10,841 INFO L225 Difference]: With dead ends: 5842 [2018-12-09 09:29:10,841 INFO L226 Difference]: Without dead ends: 5810 [2018-12-09 09:29:10,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2018-12-09 09:29:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 4662. [2018-12-09 09:29:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4662 states. [2018-12-09 09:29:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 12102 transitions. [2018-12-09 09:29:10,876 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 12102 transitions. Word has length 91 [2018-12-09 09:29:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:10,876 INFO L480 AbstractCegarLoop]: Abstraction has 4662 states and 12102 transitions. [2018-12-09 09:29:10,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 12102 transitions. [2018-12-09 09:29:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:10,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:10,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:10,879 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:10,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash -365992071, now seen corresponding path program 1 times [2018-12-09 09:29:10,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:10,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:10,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:10,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:10,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:10,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:10,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:10,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:10,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:10,919 INFO L87 Difference]: Start difference. First operand 4662 states and 12102 transitions. Second operand 7 states. [2018-12-09 09:29:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:11,139 INFO L93 Difference]: Finished difference Result 8422 states and 22444 transitions. [2018-12-09 09:29:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:29:11,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 09:29:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:11,145 INFO L225 Difference]: With dead ends: 8422 [2018-12-09 09:29:11,145 INFO L226 Difference]: Without dead ends: 8422 [2018-12-09 09:29:11,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:29:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2018-12-09 09:29:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 5098. [2018-12-09 09:29:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5098 states. [2018-12-09 09:29:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 13248 transitions. [2018-12-09 09:29:11,191 INFO L78 Accepts]: Start accepts. Automaton has 5098 states and 13248 transitions. Word has length 91 [2018-12-09 09:29:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:11,191 INFO L480 AbstractCegarLoop]: Abstraction has 5098 states and 13248 transitions. [2018-12-09 09:29:11,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 5098 states and 13248 transitions. [2018-12-09 09:29:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:11,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:11,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:11,194 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:11,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash 878772410, now seen corresponding path program 1 times [2018-12-09 09:29:11,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:11,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:11,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:11,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:11,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:11,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:11,252 INFO L87 Difference]: Start difference. First operand 5098 states and 13248 transitions. Second operand 6 states. [2018-12-09 09:29:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:11,287 INFO L93 Difference]: Finished difference Result 7868 states and 20976 transitions. [2018-12-09 09:29:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:29:11,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 09:29:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:11,293 INFO L225 Difference]: With dead ends: 7868 [2018-12-09 09:29:11,293 INFO L226 Difference]: Without dead ends: 7868 [2018-12-09 09:29:11,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2018-12-09 09:29:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 4778. [2018-12-09 09:29:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2018-12-09 09:29:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 12390 transitions. [2018-12-09 09:29:11,339 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 12390 transitions. Word has length 91 [2018-12-09 09:29:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:11,339 INFO L480 AbstractCegarLoop]: Abstraction has 4778 states and 12390 transitions. [2018-12-09 09:29:11,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 12390 transitions. [2018-12-09 09:29:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:11,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:11,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:11,343 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:11,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1359488826, now seen corresponding path program 1 times [2018-12-09 09:29:11,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:11,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:11,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:11,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:11,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:11,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:11,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:11,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:11,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:11,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:11,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:11,403 INFO L87 Difference]: Start difference. First operand 4778 states and 12390 transitions. Second operand 6 states. [2018-12-09 09:29:11,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:11,507 INFO L93 Difference]: Finished difference Result 4138 states and 10518 transitions. [2018-12-09 09:29:11,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:11,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 09:29:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:11,510 INFO L225 Difference]: With dead ends: 4138 [2018-12-09 09:29:11,510 INFO L226 Difference]: Without dead ends: 4138 [2018-12-09 09:29:11,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-12-09 09:29:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 3539. [2018-12-09 09:29:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3539 states. [2018-12-09 09:29:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 9138 transitions. [2018-12-09 09:29:11,536 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 9138 transitions. Word has length 91 [2018-12-09 09:29:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:11,536 INFO L480 AbstractCegarLoop]: Abstraction has 3539 states and 9138 transitions. [2018-12-09 09:29:11,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 9138 transitions. [2018-12-09 09:29:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:11,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:11,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:11,539 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:11,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1413527866, now seen corresponding path program 1 times [2018-12-09 09:29:11,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:11,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:11,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:11,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:11,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:11,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:11,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:11,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:11,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:11,573 INFO L87 Difference]: Start difference. First operand 3539 states and 9138 transitions. Second operand 6 states. [2018-12-09 09:29:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:11,709 INFO L93 Difference]: Finished difference Result 3752 states and 9543 transitions. [2018-12-09 09:29:11,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:11,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 09:29:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:11,712 INFO L225 Difference]: With dead ends: 3752 [2018-12-09 09:29:11,712 INFO L226 Difference]: Without dead ends: 3707 [2018-12-09 09:29:11,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2018-12-09 09:29:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3647. [2018-12-09 09:29:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2018-12-09 09:29:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 9343 transitions. [2018-12-09 09:29:11,739 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 9343 transitions. Word has length 93 [2018-12-09 09:29:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:11,739 INFO L480 AbstractCegarLoop]: Abstraction has 3647 states and 9343 transitions. [2018-12-09 09:29:11,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 9343 transitions. [2018-12-09 09:29:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:11,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:11,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:11,742 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:11,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash -522132421, now seen corresponding path program 1 times [2018-12-09 09:29:11,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:11,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:11,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:11,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:11,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:11,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:11,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:11,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:11,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:11,781 INFO L87 Difference]: Start difference. First operand 3647 states and 9343 transitions. Second operand 7 states. [2018-12-09 09:29:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:12,072 INFO L93 Difference]: Finished difference Result 5475 states and 13755 transitions. [2018-12-09 09:29:12,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:29:12,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 09:29:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:12,076 INFO L225 Difference]: With dead ends: 5475 [2018-12-09 09:29:12,076 INFO L226 Difference]: Without dead ends: 5443 [2018-12-09 09:29:12,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:29:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2018-12-09 09:29:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 4208. [2018-12-09 09:29:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4208 states. [2018-12-09 09:29:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 10724 transitions. [2018-12-09 09:29:12,113 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 10724 transitions. Word has length 93 [2018-12-09 09:29:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:12,113 INFO L480 AbstractCegarLoop]: Abstraction has 4208 states and 10724 transitions. [2018-12-09 09:29:12,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 10724 transitions. [2018-12-09 09:29:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:12,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:12,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:12,116 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:12,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 722632060, now seen corresponding path program 1 times [2018-12-09 09:29:12,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:12,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:12,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:12,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:12,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:12,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:12,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:12,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:12,174 INFO L87 Difference]: Start difference. First operand 4208 states and 10724 transitions. Second operand 6 states. [2018-12-09 09:29:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:12,256 INFO L93 Difference]: Finished difference Result 4061 states and 10272 transitions. [2018-12-09 09:29:12,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:29:12,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 09:29:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:12,261 INFO L225 Difference]: With dead ends: 4061 [2018-12-09 09:29:12,261 INFO L226 Difference]: Without dead ends: 4061 [2018-12-09 09:29:12,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:29:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2018-12-09 09:29:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 3919. [2018-12-09 09:29:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3919 states. [2018-12-09 09:29:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 10003 transitions. [2018-12-09 09:29:12,302 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 10003 transitions. Word has length 93 [2018-12-09 09:29:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:12,302 INFO L480 AbstractCegarLoop]: Abstraction has 3919 states and 10003 transitions. [2018-12-09 09:29:12,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 10003 transitions. [2018-12-09 09:29:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:12,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:12,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:12,305 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:12,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash -192366660, now seen corresponding path program 1 times [2018-12-09 09:29:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:12,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:12,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:12,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:12,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:12,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:12,344 INFO L87 Difference]: Start difference. First operand 3919 states and 10003 transitions. Second operand 5 states. [2018-12-09 09:29:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:12,455 INFO L93 Difference]: Finished difference Result 4463 states and 11347 transitions. [2018-12-09 09:29:12,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:12,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 09:29:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:12,459 INFO L225 Difference]: With dead ends: 4463 [2018-12-09 09:29:12,459 INFO L226 Difference]: Without dead ends: 4431 [2018-12-09 09:29:12,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2018-12-09 09:29:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 3678. [2018-12-09 09:29:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3678 states. [2018-12-09 09:29:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 9382 transitions. [2018-12-09 09:29:12,490 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 9382 transitions. Word has length 93 [2018-12-09 09:29:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:12,490 INFO L480 AbstractCegarLoop]: Abstraction has 3678 states and 9382 transitions. [2018-12-09 09:29:12,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 9382 transitions. [2018-12-09 09:29:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:12,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:12,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:12,493 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:12,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1052397821, now seen corresponding path program 1 times [2018-12-09 09:29:12,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:12,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:12,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:12,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:12,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:12,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:12,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:12,554 INFO L87 Difference]: Start difference. First operand 3678 states and 9382 transitions. Second operand 7 states. [2018-12-09 09:29:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:12,706 INFO L93 Difference]: Finished difference Result 5538 states and 14274 transitions. [2018-12-09 09:29:12,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:12,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 09:29:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:12,708 INFO L225 Difference]: With dead ends: 5538 [2018-12-09 09:29:12,708 INFO L226 Difference]: Without dead ends: 2009 [2018-12-09 09:29:12,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:29:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2018-12-09 09:29:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2009. [2018-12-09 09:29:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-12-09 09:29:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5170 transitions. [2018-12-09 09:29:12,722 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5170 transitions. Word has length 93 [2018-12-09 09:29:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:12,723 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5170 transitions. [2018-12-09 09:29:12,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5170 transitions. [2018-12-09 09:29:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:12,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:12,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:12,724 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:12,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1042938802, now seen corresponding path program 1 times [2018-12-09 09:29:12,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:12,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:12,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:12,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:12,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:12,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:12,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:12,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:12,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:12,783 INFO L87 Difference]: Start difference. First operand 2009 states and 5170 transitions. Second operand 7 states. [2018-12-09 09:29:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:12,894 INFO L93 Difference]: Finished difference Result 2023 states and 5202 transitions. [2018-12-09 09:29:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:12,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 09:29:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:12,896 INFO L225 Difference]: With dead ends: 2023 [2018-12-09 09:29:12,896 INFO L226 Difference]: Without dead ends: 2023 [2018-12-09 09:29:12,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-12-09 09:29:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1985. [2018-12-09 09:29:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-12-09 09:29:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 5122 transitions. [2018-12-09 09:29:12,909 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 5122 transitions. Word has length 93 [2018-12-09 09:29:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:12,909 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 5122 transitions. [2018-12-09 09:29:12,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 5122 transitions. [2018-12-09 09:29:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:12,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:12,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:12,911 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:12,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:12,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1157749772, now seen corresponding path program 2 times [2018-12-09 09:29:12,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:12,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:12,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:12,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:29:12,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:12,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:29:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:29:12,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:12,974 INFO L87 Difference]: Start difference. First operand 1985 states and 5122 transitions. Second operand 8 states. [2018-12-09 09:29:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:13,213 INFO L93 Difference]: Finished difference Result 2330 states and 5862 transitions. [2018-12-09 09:29:13,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:29:13,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-09 09:29:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:13,215 INFO L225 Difference]: With dead ends: 2330 [2018-12-09 09:29:13,215 INFO L226 Difference]: Without dead ends: 2301 [2018-12-09 09:29:13,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:29:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2018-12-09 09:29:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 1977. [2018-12-09 09:29:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2018-12-09 09:29:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 5096 transitions. [2018-12-09 09:29:13,228 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 5096 transitions. Word has length 93 [2018-12-09 09:29:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:13,228 INFO L480 AbstractCegarLoop]: Abstraction has 1977 states and 5096 transitions. [2018-12-09 09:29:13,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:29:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 5096 transitions. [2018-12-09 09:29:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:13,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:13,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:13,230 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:13,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:13,230 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2018-12-09 09:29:13,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:13,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:13,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:29:13,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:13,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:13,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:13,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:29:13,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:13,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:29:13,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:29:13,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:29:13,346 INFO L87 Difference]: Start difference. First operand 1977 states and 5096 transitions. Second operand 12 states. [2018-12-09 09:29:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:13,717 INFO L93 Difference]: Finished difference Result 3769 states and 9808 transitions. [2018-12-09 09:29:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:29:13,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-09 09:29:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:13,721 INFO L225 Difference]: With dead ends: 3769 [2018-12-09 09:29:13,721 INFO L226 Difference]: Without dead ends: 2633 [2018-12-09 09:29:13,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 09:29:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-12-09 09:29:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2481. [2018-12-09 09:29:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2018-12-09 09:29:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 6234 transitions. [2018-12-09 09:29:13,747 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 6234 transitions. Word has length 93 [2018-12-09 09:29:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:13,748 INFO L480 AbstractCegarLoop]: Abstraction has 2481 states and 6234 transitions. [2018-12-09 09:29:13,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:29:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 6234 transitions. [2018-12-09 09:29:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:13,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:13,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:13,750 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:13,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:13,750 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2018-12-09 09:29:13,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:13,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:29:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:13,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:29:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:29:13,786 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:29:13,845 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 09:29:13,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:29:13 BasicIcfg [2018-12-09 09:29:13,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:29:13,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:29:13,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:29:13,847 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:29:13,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:28:59" (3/4) ... [2018-12-09 09:29:13,849 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:29:13,917 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_65dc52b5-6cc6-4640-ade6-8af81e2745ec/bin-2019/utaipan/witness.graphml [2018-12-09 09:29:13,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:29:13,918 INFO L168 Benchmark]: Toolchain (without parser) took 15494.86 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 948.1 MB in the beginning and 888.7 MB in the end (delta: 59.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-09 09:29:13,919 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:29:13,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:13,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:13,920 INFO L168 Benchmark]: Boogie Preprocessor took 19.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:29:13,920 INFO L168 Benchmark]: RCFGBuilder took 366.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:13,920 INFO L168 Benchmark]: TraceAbstraction took 14686.56 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 921.4 MB in the end (delta: 119.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-09 09:29:13,920 INFO L168 Benchmark]: Witness Printer took 70.56 ms. Allocated memory is still 2.7 GB. Free memory was 921.4 MB in the beginning and 888.7 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:13,922 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 366.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14686.56 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 921.4 MB in the end (delta: 119.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 70.56 ms. Allocated memory is still 2.7 GB. Free memory was 921.4 MB in the beginning and 888.7 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] -1 pthread_t t2483; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] FCALL, FORK -1 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2484; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 14.6s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7242 SDtfs, 6538 SDslu, 16475 SDs, 0 SdLazy, 6749 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 87 SyntacticMatches, 17 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 92834 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2544 NumberOfCodeBlocks, 2544 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2420 ConstructedInterpolants, 0 QuantifiedInterpolants, 484218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...