./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.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_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/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 f826e25c8c31c46de95cdece910a51d666dafee4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:07:19,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 03:07:19,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 03:07:19,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 03:07:19,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 03:07:19,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 03:07:19,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 03:07:19,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 03:07:19,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 03:07:19,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 03:07:19,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 03:07:19,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 03:07:19,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 03:07:19,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 03:07:19,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 03:07:19,090 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 03:07:19,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 03:07:19,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 03:07:19,093 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 03:07:19,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 03:07:19,094 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 03:07:19,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 03:07:19,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 03:07:19,096 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 03:07:19,096 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 03:07:19,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 03:07:19,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 03:07:19,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 03:07:19,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 03:07:19,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 03:07:19,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 03:07:19,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 03:07:19,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 03:07:19,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 03:07:19,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 03:07:19,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 03:07:19,099 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 03:07:19,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 03:07:19,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 03:07:19,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 03:07:19,110 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 03:07:19,110 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 03:07:19,110 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 03:07:19,110 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 03:07:19,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 03:07:19,110 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 03:07:19,111 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 03:07:19,111 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 03:07:19,111 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 03:07:19,111 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 03:07:19,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 03:07:19,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 03:07:19,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 03:07:19,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 03:07:19,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 03:07:19,112 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 03:07:19,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 03:07:19,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 03:07:19,113 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 03:07:19,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 03:07:19,113 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 03:07:19,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 03:07:19,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 03:07:19,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 03:07:19,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 03:07:19,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:07:19,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 03:07:19,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 03:07:19,114 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 03:07:19,114 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 03:07:19,115 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 03:07:19,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 03:07:19,115 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 03:07:19,115 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_e0877745-75ef-4da0-81f8-5ef61a5b7288/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 -> f826e25c8c31c46de95cdece910a51d666dafee4 [2018-12-09 03:07:19,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 03:07:19,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 03:07:19,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 03:07:19,148 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 03:07:19,148 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 03:07:19,149 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i [2018-12-09 03:07:19,181 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/data/0317afd07/1e0866f177da455bbc9295393b80692b/FLAG804e4d69e [2018-12-09 03:07:19,584 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 03:07:19,584 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i [2018-12-09 03:07:19,591 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/data/0317afd07/1e0866f177da455bbc9295393b80692b/FLAG804e4d69e [2018-12-09 03:07:19,600 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/data/0317afd07/1e0866f177da455bbc9295393b80692b [2018-12-09 03:07:19,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 03:07:19,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 03:07:19,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 03:07:19,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 03:07:19,606 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 03:07:19,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268b2141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19, skipping insertion in model container [2018-12-09 03:07:19,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 03:07:19,635 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 03:07:19,824 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:07:19,831 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 03:07:19,903 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:07:19,931 INFO L195 MainTranslator]: Completed translation [2018-12-09 03:07:19,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19 WrapperNode [2018-12-09 03:07:19,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 03:07:19,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 03:07:19,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 03:07:19,932 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 03:07:19,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 03:07:19,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 03:07:19,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 03:07:19,963 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 03:07:19,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... [2018-12-09 03:07:19,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 03:07:19,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 03:07:19,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 03:07:19,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 03:07:19,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/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 03:07:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 03:07:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 03:07:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 03:07:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 03:07:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 03:07:20,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 03:07:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 03:07:20,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 03:07:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 03:07:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 03:07:20,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 03:07:20,017 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 03:07:20,358 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 03:07:20,358 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 03:07:20,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:20 BoogieIcfgContainer [2018-12-09 03:07:20,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 03:07:20,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 03:07:20,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 03:07:20,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 03:07:20,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:07:19" (1/3) ... [2018-12-09 03:07:20,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3cd703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:07:20, skipping insertion in model container [2018-12-09 03:07:20,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:19" (2/3) ... [2018-12-09 03:07:20,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3cd703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:07:20, skipping insertion in model container [2018-12-09 03:07:20,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:20" (3/3) ... [2018-12-09 03:07:20,363 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_tso.oepc_false-unreach-call.i [2018-12-09 03:07:20,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,389 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,389 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,389 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,409 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,409 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:20,432 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 03:07:20,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 03:07:20,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 03:07:20,447 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 03:07:20,461 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 03:07:20,461 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 03:07:20,461 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 03:07:20,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 03:07:20,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 03:07:20,461 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 03:07:20,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 03:07:20,462 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 03:07:20,468 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-09 03:07:28,374 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-09 03:07:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-09 03:07:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 03:07:28,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:28,381 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] [2018-12-09 03:07:28,383 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:28,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -513582767, now seen corresponding path program 1 times [2018-12-09 03:07:28,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:28,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:28,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:28,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:28,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:28,529 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 03:07:28,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:28,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:07:28,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:28,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:28,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:28,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:28,544 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-09 03:07:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:29,815 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-09 03:07:29,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:29,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 03:07:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:30,229 INFO L225 Difference]: With dead ends: 192000 [2018-12-09 03:07:30,229 INFO L226 Difference]: Without dead ends: 135832 [2018-12-09 03:07:30,230 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 03:07:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-09 03:07:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-09 03:07:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-09 03:07:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-09 03:07:33,084 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-09 03:07:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:33,084 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-09 03:07:33,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:07:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-09 03:07:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 03:07:33,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:33,090 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] [2018-12-09 03:07:33,090 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:33,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash 133524022, now seen corresponding path program 1 times [2018-12-09 03:07:33,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:33,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:33,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:33,151 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 03:07:33,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:33,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:07:33,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:33,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:07:33,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:07:33,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:07:33,153 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-12-09 03:07:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:35,590 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-12-09 03:07:35,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:07:35,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 03:07:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:35,986 INFO L225 Difference]: With dead ends: 195844 [2018-12-09 03:07:35,987 INFO L226 Difference]: Without dead ends: 195292 [2018-12-09 03:07:35,987 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 03:07:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-12-09 03:07:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-12-09 03:07:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-12-09 03:07:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-12-09 03:07:39,371 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-12-09 03:07:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:39,372 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-12-09 03:07:39,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:07:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-12-09 03:07:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 03:07:39,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:39,375 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] [2018-12-09 03:07:39,376 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:39,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash 84336861, now seen corresponding path program 1 times [2018-12-09 03:07:39,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:39,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:39,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:39,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:39,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:39,427 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 03:07:39,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:39,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:07:39,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:39,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:07:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:07:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:07:39,428 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-12-09 03:07:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:40,924 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-12-09 03:07:40,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:07:40,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 03:07:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:41,462 INFO L225 Difference]: With dead ends: 253868 [2018-12-09 03:07:41,462 INFO L226 Difference]: Without dead ends: 253356 [2018-12-09 03:07:41,463 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 03:07:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-12-09 03:07:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-12-09 03:07:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-12-09 03:07:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-12-09 03:07:45,739 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-12-09 03:07:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:45,739 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-12-09 03:07:45,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:07:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-12-09 03:07:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 03:07:45,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:45,745 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] [2018-12-09 03:07:45,745 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:45,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash 475594115, now seen corresponding path program 1 times [2018-12-09 03:07:45,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:45,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:45,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:45,771 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 03:07:45,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:45,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:07:45,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:45,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:07:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:07:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:07:45,773 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-12-09 03:07:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:47,019 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-12-09 03:07:47,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:07:47,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 03:07:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:47,469 INFO L225 Difference]: With dead ends: 234162 [2018-12-09 03:07:47,469 INFO L226 Difference]: Without dead ends: 234162 [2018-12-09 03:07:47,469 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 03:07:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-12-09 03:07:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-12-09 03:07:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-12-09 03:07:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-12-09 03:07:54,015 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-12-09 03:07:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:54,016 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-12-09 03:07:54,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:07:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-12-09 03:07:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 03:07:54,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:54,030 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] [2018-12-09 03:07:54,030 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:54,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1121194702, now seen corresponding path program 1 times [2018-12-09 03:07:54,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:54,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:54,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:54,092 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 03:07:54,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:54,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:07:54,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:54,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:07:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:07:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:07:54,093 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-12-09 03:07:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:56,470 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-12-09 03:07:56,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 03:07:56,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 03:07:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:57,303 INFO L225 Difference]: With dead ends: 402833 [2018-12-09 03:07:57,303 INFO L226 Difference]: Without dead ends: 402257 [2018-12-09 03:07:57,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 03:08:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-12-09 03:08:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-12-09 03:08:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-12-09 03:08:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-12-09 03:08:06,537 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-12-09 03:08:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:06,538 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-12-09 03:08:06,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-12-09 03:08:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 03:08:06,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:06,551 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] [2018-12-09 03:08:06,551 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:06,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1930693029, now seen corresponding path program 1 times [2018-12-09 03:08:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:06,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:06,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:06,614 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 03:08:06,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:06,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:06,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:06,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:06,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:06,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:06,615 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-12-09 03:08:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:08,431 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-12-09 03:08:08,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 03:08:08,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-09 03:08:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:09,542 INFO L225 Difference]: With dead ends: 325852 [2018-12-09 03:08:09,542 INFO L226 Difference]: Without dead ends: 325852 [2018-12-09 03:08:09,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:08:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-12-09 03:08:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-12-09 03:08:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-12-09 03:08:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-12-09 03:08:17,779 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-12-09 03:08:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:17,779 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-12-09 03:08:17,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-12-09 03:08:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 03:08:17,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:17,797 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] [2018-12-09 03:08:17,797 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:17,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:17,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1476770586, now seen corresponding path program 1 times [2018-12-09 03:08:17,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:17,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:17,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:17,834 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 03:08:17,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:17,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:17,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:17,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:17,835 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 3 states. [2018-12-09 03:08:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:18,909 INFO L93 Difference]: Finished difference Result 209798 states and 761087 transitions. [2018-12-09 03:08:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:18,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-09 03:08:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:19,353 INFO L225 Difference]: With dead ends: 209798 [2018-12-09 03:08:19,353 INFO L226 Difference]: Without dead ends: 209798 [2018-12-09 03:08:19,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 03:08:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209798 states. [2018-12-09 03:08:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209798 to 207253. [2018-12-09 03:08:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207253 states. [2018-12-09 03:08:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207253 states to 207253 states and 752339 transitions. [2018-12-09 03:08:24,043 INFO L78 Accepts]: Start accepts. Automaton has 207253 states and 752339 transitions. Word has length 54 [2018-12-09 03:08:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:24,043 INFO L480 AbstractCegarLoop]: Abstraction has 207253 states and 752339 transitions. [2018-12-09 03:08:24,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 207253 states and 752339 transitions. [2018-12-09 03:08:24,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 03:08:24,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:24,057 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] [2018-12-09 03:08:24,057 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:24,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:24,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1480801646, now seen corresponding path program 1 times [2018-12-09 03:08:24,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:24,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:24,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:24,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:24,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:24,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 03:08:24,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:24,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:24,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:24,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:24,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:24,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:24,098 INFO L87 Difference]: Start difference. First operand 207253 states and 752339 transitions. Second operand 4 states. [2018-12-09 03:08:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:24,189 INFO L93 Difference]: Finished difference Result 32822 states and 104262 transitions. [2018-12-09 03:08:24,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:08:24,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 03:08:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:24,223 INFO L225 Difference]: With dead ends: 32822 [2018-12-09 03:08:24,223 INFO L226 Difference]: Without dead ends: 24964 [2018-12-09 03:08:24,224 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 03:08:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24964 states. [2018-12-09 03:08:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24964 to 24717. [2018-12-09 03:08:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24717 states. [2018-12-09 03:08:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24717 states to 24717 states and 75708 transitions. [2018-12-09 03:08:24,493 INFO L78 Accepts]: Start accepts. Automaton has 24717 states and 75708 transitions. Word has length 55 [2018-12-09 03:08:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:24,493 INFO L480 AbstractCegarLoop]: Abstraction has 24717 states and 75708 transitions. [2018-12-09 03:08:24,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24717 states and 75708 transitions. [2018-12-09 03:08:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 03:08:24,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:24,496 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] [2018-12-09 03:08:24,496 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:24,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1656702890, now seen corresponding path program 1 times [2018-12-09 03:08:24,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:24,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:24,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:24,536 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 03:08:24,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:24,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:24,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:24,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:24,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:24,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:24,537 INFO L87 Difference]: Start difference. First operand 24717 states and 75708 transitions. Second operand 4 states. [2018-12-09 03:08:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:24,641 INFO L93 Difference]: Finished difference Result 27155 states and 82977 transitions. [2018-12-09 03:08:24,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:08:24,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-09 03:08:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:24,674 INFO L225 Difference]: With dead ends: 27155 [2018-12-09 03:08:24,674 INFO L226 Difference]: Without dead ends: 27155 [2018-12-09 03:08:24,674 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 03:08:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27155 states. [2018-12-09 03:08:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27155 to 25562. [2018-12-09 03:08:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25562 states. [2018-12-09 03:08:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25562 states to 25562 states and 78203 transitions. [2018-12-09 03:08:25,220 INFO L78 Accepts]: Start accepts. Automaton has 25562 states and 78203 transitions. Word has length 62 [2018-12-09 03:08:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:25,220 INFO L480 AbstractCegarLoop]: Abstraction has 25562 states and 78203 transitions. [2018-12-09 03:08:25,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25562 states and 78203 transitions. [2018-12-09 03:08:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 03:08:25,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:25,223 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] [2018-12-09 03:08:25,224 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:25,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:25,224 INFO L82 PathProgramCache]: Analyzing trace with hash -895454071, now seen corresponding path program 1 times [2018-12-09 03:08:25,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:25,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:25,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:25,278 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 03:08:25,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:25,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:25,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:25,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:25,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:25,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:25,280 INFO L87 Difference]: Start difference. First operand 25562 states and 78203 transitions. Second operand 6 states. [2018-12-09 03:08:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:25,761 INFO L93 Difference]: Finished difference Result 53444 states and 162274 transitions. [2018-12-09 03:08:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 03:08:25,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 03:08:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:25,829 INFO L225 Difference]: With dead ends: 53444 [2018-12-09 03:08:25,829 INFO L226 Difference]: Without dead ends: 53373 [2018-12-09 03:08:25,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:08:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53373 states. [2018-12-09 03:08:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53373 to 32726. [2018-12-09 03:08:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32726 states. [2018-12-09 03:08:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32726 states to 32726 states and 98221 transitions. [2018-12-09 03:08:26,287 INFO L78 Accepts]: Start accepts. Automaton has 32726 states and 98221 transitions. Word has length 62 [2018-12-09 03:08:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:26,287 INFO L480 AbstractCegarLoop]: Abstraction has 32726 states and 98221 transitions. [2018-12-09 03:08:26,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 32726 states and 98221 transitions. [2018-12-09 03:08:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 03:08:26,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:26,293 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] [2018-12-09 03:08:26,293 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:26,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:26,293 INFO L82 PathProgramCache]: Analyzing trace with hash -191697734, now seen corresponding path program 1 times [2018-12-09 03:08:26,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:26,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:26,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:26,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:26,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:26,313 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 03:08:26,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:26,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:26,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:26,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:26,314 INFO L87 Difference]: Start difference. First operand 32726 states and 98221 transitions. Second operand 3 states. [2018-12-09 03:08:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:26,420 INFO L93 Difference]: Finished difference Result 40875 states and 121466 transitions. [2018-12-09 03:08:26,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:26,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 03:08:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:26,465 INFO L225 Difference]: With dead ends: 40875 [2018-12-09 03:08:26,465 INFO L226 Difference]: Without dead ends: 40875 [2018-12-09 03:08:26,466 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 03:08:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40875 states. [2018-12-09 03:08:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40875 to 33483. [2018-12-09 03:08:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33483 states. [2018-12-09 03:08:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33483 states to 33483 states and 98578 transitions. [2018-12-09 03:08:26,852 INFO L78 Accepts]: Start accepts. Automaton has 33483 states and 98578 transitions. Word has length 68 [2018-12-09 03:08:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:26,852 INFO L480 AbstractCegarLoop]: Abstraction has 33483 states and 98578 transitions. [2018-12-09 03:08:26,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 33483 states and 98578 transitions. [2018-12-09 03:08:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 03:08:26,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:26,860 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] [2018-12-09 03:08:26,860 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:26,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash -690040115, now seen corresponding path program 1 times [2018-12-09 03:08:26,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:26,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:27,543 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 03:08:27,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:27,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:27,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:27,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:27,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:27,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:27,543 INFO L87 Difference]: Start difference. First operand 33483 states and 98578 transitions. Second operand 5 states. [2018-12-09 03:08:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:27,819 INFO L93 Difference]: Finished difference Result 38508 states and 113005 transitions. [2018-12-09 03:08:27,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:08:27,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-09 03:08:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:27,860 INFO L225 Difference]: With dead ends: 38508 [2018-12-09 03:08:27,860 INFO L226 Difference]: Without dead ends: 38508 [2018-12-09 03:08:27,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:08:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38508 states. [2018-12-09 03:08:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38508 to 36833. [2018-12-09 03:08:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36833 states. [2018-12-09 03:08:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36833 states to 36833 states and 108189 transitions. [2018-12-09 03:08:28,241 INFO L78 Accepts]: Start accepts. Automaton has 36833 states and 108189 transitions. Word has length 74 [2018-12-09 03:08:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:28,242 INFO L480 AbstractCegarLoop]: Abstraction has 36833 states and 108189 transitions. [2018-12-09 03:08:28,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 36833 states and 108189 transitions. [2018-12-09 03:08:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 03:08:28,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:28,250 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] [2018-12-09 03:08:28,250 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:28,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1052770220, now seen corresponding path program 1 times [2018-12-09 03:08:28,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:28,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:28,301 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 03:08:28,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:28,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:28,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:28,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:28,303 INFO L87 Difference]: Start difference. First operand 36833 states and 108189 transitions. Second operand 7 states. [2018-12-09 03:08:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:28,812 INFO L93 Difference]: Finished difference Result 44363 states and 130601 transitions. [2018-12-09 03:08:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 03:08:28,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 03:08:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:28,860 INFO L225 Difference]: With dead ends: 44363 [2018-12-09 03:08:28,860 INFO L226 Difference]: Without dead ends: 44276 [2018-12-09 03:08:28,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 03:08:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44276 states. [2018-12-09 03:08:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44276 to 33054. [2018-12-09 03:08:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33054 states. [2018-12-09 03:08:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33054 states to 33054 states and 98260 transitions. [2018-12-09 03:08:29,256 INFO L78 Accepts]: Start accepts. Automaton has 33054 states and 98260 transitions. Word has length 74 [2018-12-09 03:08:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:29,256 INFO L480 AbstractCegarLoop]: Abstraction has 33054 states and 98260 transitions. [2018-12-09 03:08:29,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 33054 states and 98260 transitions. [2018-12-09 03:08:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 03:08:29,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:29,264 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 03:08:29,264 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:29,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1736865076, now seen corresponding path program 1 times [2018-12-09 03:08:29,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:29,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:29,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:29,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:29,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:29,313 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 03:08:29,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:29,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:29,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:29,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:29,314 INFO L87 Difference]: Start difference. First operand 33054 states and 98260 transitions. Second operand 7 states. [2018-12-09 03:08:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:30,000 INFO L93 Difference]: Finished difference Result 73264 states and 216100 transitions. [2018-12-09 03:08:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 03:08:30,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-09 03:08:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:30,080 INFO L225 Difference]: With dead ends: 73264 [2018-12-09 03:08:30,080 INFO L226 Difference]: Without dead ends: 73200 [2018-12-09 03:08:30,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-12-09 03:08:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73200 states. [2018-12-09 03:08:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73200 to 42473. [2018-12-09 03:08:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42473 states. [2018-12-09 03:08:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42473 states to 42473 states and 124402 transitions. [2018-12-09 03:08:30,644 INFO L78 Accepts]: Start accepts. Automaton has 42473 states and 124402 transitions. Word has length 76 [2018-12-09 03:08:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:30,644 INFO L480 AbstractCegarLoop]: Abstraction has 42473 states and 124402 transitions. [2018-12-09 03:08:30,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 42473 states and 124402 transitions. [2018-12-09 03:08:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 03:08:30,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:30,659 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] [2018-12-09 03:08:30,659 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:30,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1045447395, now seen corresponding path program 1 times [2018-12-09 03:08:30,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:30,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:30,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:30,692 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 03:08:30,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:30,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:30,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:30,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:30,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:30,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:30,693 INFO L87 Difference]: Start difference. First operand 42473 states and 124402 transitions. Second operand 4 states. [2018-12-09 03:08:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:30,836 INFO L93 Difference]: Finished difference Result 47450 states and 136404 transitions. [2018-12-09 03:08:30,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:30,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-09 03:08:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:30,887 INFO L225 Difference]: With dead ends: 47450 [2018-12-09 03:08:30,887 INFO L226 Difference]: Without dead ends: 47450 [2018-12-09 03:08:30,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 03:08:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47450 states. [2018-12-09 03:08:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47450 to 43792. [2018-12-09 03:08:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43792 states. [2018-12-09 03:08:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43792 states to 43792 states and 125556 transitions. [2018-12-09 03:08:31,342 INFO L78 Accepts]: Start accepts. Automaton has 43792 states and 125556 transitions. Word has length 83 [2018-12-09 03:08:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:31,342 INFO L480 AbstractCegarLoop]: Abstraction has 43792 states and 125556 transitions. [2018-12-09 03:08:31,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 43792 states and 125556 transitions. [2018-12-09 03:08:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 03:08:31,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:31,357 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] [2018-12-09 03:08:31,357 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:31,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:31,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1366691952, now seen corresponding path program 1 times [2018-12-09 03:08:31,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:31,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:31,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:31,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 03:08:31,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:31,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:31,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:31,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:31,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:31,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:31,404 INFO L87 Difference]: Start difference. First operand 43792 states and 125556 transitions. Second operand 4 states. [2018-12-09 03:08:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:31,809 INFO L93 Difference]: Finished difference Result 51886 states and 146275 transitions. [2018-12-09 03:08:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:08:31,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-09 03:08:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:31,862 INFO L225 Difference]: With dead ends: 51886 [2018-12-09 03:08:31,863 INFO L226 Difference]: Without dead ends: 51886 [2018-12-09 03:08:31,863 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 03:08:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51886 states. [2018-12-09 03:08:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51886 to 49652. [2018-12-09 03:08:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49652 states. [2018-12-09 03:08:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49652 states to 49652 states and 140792 transitions. [2018-12-09 03:08:32,421 INFO L78 Accepts]: Start accepts. Automaton has 49652 states and 140792 transitions. Word has length 84 [2018-12-09 03:08:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:32,421 INFO L480 AbstractCegarLoop]: Abstraction has 49652 states and 140792 transitions. [2018-12-09 03:08:32,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 49652 states and 140792 transitions. [2018-12-09 03:08:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 03:08:32,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:32,438 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] [2018-12-09 03:08:32,439 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:32,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:32,439 INFO L82 PathProgramCache]: Analyzing trace with hash 851066001, now seen corresponding path program 1 times [2018-12-09 03:08:32,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:32,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:32,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:32,476 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 03:08:32,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:32,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:32,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:32,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:32,477 INFO L87 Difference]: Start difference. First operand 49652 states and 140792 transitions. Second operand 5 states. [2018-12-09 03:08:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:32,533 INFO L93 Difference]: Finished difference Result 22000 states and 53993 transitions. [2018-12-09 03:08:32,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:08:32,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-12-09 03:08:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:32,547 INFO L225 Difference]: With dead ends: 22000 [2018-12-09 03:08:32,547 INFO L226 Difference]: Without dead ends: 20041 [2018-12-09 03:08:32,548 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 03:08:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20041 states. [2018-12-09 03:08:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20041 to 16787. [2018-12-09 03:08:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16787 states. [2018-12-09 03:08:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16787 states to 16787 states and 41093 transitions. [2018-12-09 03:08:32,698 INFO L78 Accepts]: Start accepts. Automaton has 16787 states and 41093 transitions. Word has length 84 [2018-12-09 03:08:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:32,698 INFO L480 AbstractCegarLoop]: Abstraction has 16787 states and 41093 transitions. [2018-12-09 03:08:32,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 16787 states and 41093 transitions. [2018-12-09 03:08:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:32,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:32,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:32,709 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:32,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash -952932386, now seen corresponding path program 1 times [2018-12-09 03:08:32,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:32,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:32,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:32,751 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 03:08:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:32,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:32,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:32,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:32,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:32,752 INFO L87 Difference]: Start difference. First operand 16787 states and 41093 transitions. Second operand 5 states. [2018-12-09 03:08:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:32,835 INFO L93 Difference]: Finished difference Result 19597 states and 47367 transitions. [2018-12-09 03:08:32,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:32,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-09 03:08:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:32,849 INFO L225 Difference]: With dead ends: 19597 [2018-12-09 03:08:32,849 INFO L226 Difference]: Without dead ends: 19597 [2018-12-09 03:08:32,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 03:08:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19597 states. [2018-12-09 03:08:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19597 to 15476. [2018-12-09 03:08:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15476 states. [2018-12-09 03:08:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15476 states to 15476 states and 37384 transitions. [2018-12-09 03:08:32,989 INFO L78 Accepts]: Start accepts. Automaton has 15476 states and 37384 transitions. Word has length 113 [2018-12-09 03:08:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:32,989 INFO L480 AbstractCegarLoop]: Abstraction has 15476 states and 37384 transitions. [2018-12-09 03:08:32,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15476 states and 37384 transitions. [2018-12-09 03:08:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:33,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:33,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:33,000 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:33,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1408837945, now seen corresponding path program 1 times [2018-12-09 03:08:33,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:33,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:33,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:33,055 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 03:08:33,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:33,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:33,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:33,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:33,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:33,056 INFO L87 Difference]: Start difference. First operand 15476 states and 37384 transitions. Second operand 5 states. [2018-12-09 03:08:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:33,388 INFO L93 Difference]: Finished difference Result 18394 states and 44376 transitions. [2018-12-09 03:08:33,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:33,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-09 03:08:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:33,401 INFO L225 Difference]: With dead ends: 18394 [2018-12-09 03:08:33,401 INFO L226 Difference]: Without dead ends: 18380 [2018-12-09 03:08:33,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-09 03:08:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16712. [2018-12-09 03:08:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16712 states. [2018-12-09 03:08:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16712 states to 16712 states and 40590 transitions. [2018-12-09 03:08:33,546 INFO L78 Accepts]: Start accepts. Automaton has 16712 states and 40590 transitions. Word has length 113 [2018-12-09 03:08:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:33,546 INFO L480 AbstractCegarLoop]: Abstraction has 16712 states and 40590 transitions. [2018-12-09 03:08:33,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16712 states and 40590 transitions. [2018-12-09 03:08:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:33,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:33,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:33,558 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:33,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:33,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1924515334, now seen corresponding path program 1 times [2018-12-09 03:08:33,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:33,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:33,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:33,729 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 03:08:33,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:33,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 03:08:33,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:33,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 03:08:33,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 03:08:33,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:08:33,730 INFO L87 Difference]: Start difference. First operand 16712 states and 40590 transitions. Second operand 10 states. [2018-12-09 03:08:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:34,575 INFO L93 Difference]: Finished difference Result 22401 states and 53117 transitions. [2018-12-09 03:08:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 03:08:34,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-09 03:08:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:34,591 INFO L225 Difference]: With dead ends: 22401 [2018-12-09 03:08:34,591 INFO L226 Difference]: Without dead ends: 22401 [2018-12-09 03:08:34,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-12-09 03:08:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22401 states. [2018-12-09 03:08:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22401 to 19720. [2018-12-09 03:08:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19720 states. [2018-12-09 03:08:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19720 states to 19720 states and 47091 transitions. [2018-12-09 03:08:34,773 INFO L78 Accepts]: Start accepts. Automaton has 19720 states and 47091 transitions. Word has length 113 [2018-12-09 03:08:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:34,773 INFO L480 AbstractCegarLoop]: Abstraction has 19720 states and 47091 transitions. [2018-12-09 03:08:34,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 03:08:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 19720 states and 47091 transitions. [2018-12-09 03:08:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:34,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:34,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:34,787 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:34,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash -850123970, now seen corresponding path program 1 times [2018-12-09 03:08:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:34,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:34,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:34,826 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 03:08:34,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:34,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:34,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:34,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:34,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:34,827 INFO L87 Difference]: Start difference. First operand 19720 states and 47091 transitions. Second operand 4 states. [2018-12-09 03:08:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:34,956 INFO L93 Difference]: Finished difference Result 21561 states and 51172 transitions. [2018-12-09 03:08:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:34,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-09 03:08:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:34,972 INFO L225 Difference]: With dead ends: 21561 [2018-12-09 03:08:34,972 INFO L226 Difference]: Without dead ends: 21541 [2018-12-09 03:08:34,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 03:08:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21541 states. [2018-12-09 03:08:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21541 to 20695. [2018-12-09 03:08:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20695 states. [2018-12-09 03:08:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20695 states to 20695 states and 49276 transitions. [2018-12-09 03:08:35,151 INFO L78 Accepts]: Start accepts. Automaton has 20695 states and 49276 transitions. Word has length 113 [2018-12-09 03:08:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:35,151 INFO L480 AbstractCegarLoop]: Abstraction has 20695 states and 49276 transitions. [2018-12-09 03:08:35,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 20695 states and 49276 transitions. [2018-12-09 03:08:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:35,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:35,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:35,167 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:35,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash 394640511, now seen corresponding path program 1 times [2018-12-09 03:08:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:35,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:35,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:35,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 03:08:35,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:35,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:35,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:35,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:35,252 INFO L87 Difference]: Start difference. First operand 20695 states and 49276 transitions. Second operand 7 states. [2018-12-09 03:08:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:35,541 INFO L93 Difference]: Finished difference Result 29916 states and 69381 transitions. [2018-12-09 03:08:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:08:35,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 03:08:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:35,562 INFO L225 Difference]: With dead ends: 29916 [2018-12-09 03:08:35,562 INFO L226 Difference]: Without dead ends: 29895 [2018-12-09 03:08:35,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:08:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29895 states. [2018-12-09 03:08:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29895 to 25757. [2018-12-09 03:08:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25757 states. [2018-12-09 03:08:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25757 states to 25757 states and 59989 transitions. [2018-12-09 03:08:35,800 INFO L78 Accepts]: Start accepts. Automaton has 25757 states and 59989 transitions. Word has length 113 [2018-12-09 03:08:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:35,800 INFO L480 AbstractCegarLoop]: Abstraction has 25757 states and 59989 transitions. [2018-12-09 03:08:35,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 25757 states and 59989 transitions. [2018-12-09 03:08:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:35,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:35,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:35,818 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:35,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1682568832, now seen corresponding path program 1 times [2018-12-09 03:08:35,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:35,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:35,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:35,883 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 03:08:35,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:35,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 03:08:35,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:35,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 03:08:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 03:08:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:08:35,884 INFO L87 Difference]: Start difference. First operand 25757 states and 59989 transitions. Second operand 8 states. [2018-12-09 03:08:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:37,146 INFO L93 Difference]: Finished difference Result 31423 states and 72868 transitions. [2018-12-09 03:08:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 03:08:37,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 03:08:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:37,179 INFO L225 Difference]: With dead ends: 31423 [2018-12-09 03:08:37,179 INFO L226 Difference]: Without dead ends: 31423 [2018-12-09 03:08:37,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-12-09 03:08:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31423 states. [2018-12-09 03:08:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31423 to 28451. [2018-12-09 03:08:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28451 states. [2018-12-09 03:08:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28451 states to 28451 states and 66352 transitions. [2018-12-09 03:08:37,446 INFO L78 Accepts]: Start accepts. Automaton has 28451 states and 66352 transitions. Word has length 113 [2018-12-09 03:08:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:37,446 INFO L480 AbstractCegarLoop]: Abstraction has 28451 states and 66352 transitions. [2018-12-09 03:08:37,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 03:08:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 28451 states and 66352 transitions. [2018-12-09 03:08:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:37,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:37,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:37,467 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:37,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1471217919, now seen corresponding path program 1 times [2018-12-09 03:08:37,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:37,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:37,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:37,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:37,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:37,502 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 03:08:37,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:37,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:37,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:37,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:37,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:37,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:37,504 INFO L87 Difference]: Start difference. First operand 28451 states and 66352 transitions. Second operand 3 states. [2018-12-09 03:08:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:37,578 INFO L93 Difference]: Finished difference Result 36935 states and 85774 transitions. [2018-12-09 03:08:37,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:37,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-09 03:08:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:37,608 INFO L225 Difference]: With dead ends: 36935 [2018-12-09 03:08:37,608 INFO L226 Difference]: Without dead ends: 36935 [2018-12-09 03:08:37,608 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 03:08:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36935 states. [2018-12-09 03:08:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36935 to 36568. [2018-12-09 03:08:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36568 states. [2018-12-09 03:08:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36568 states to 36568 states and 84950 transitions. [2018-12-09 03:08:37,930 INFO L78 Accepts]: Start accepts. Automaton has 36568 states and 84950 transitions. Word has length 113 [2018-12-09 03:08:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:37,930 INFO L480 AbstractCegarLoop]: Abstraction has 36568 states and 84950 transitions. [2018-12-09 03:08:37,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36568 states and 84950 transitions. [2018-12-09 03:08:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:37,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:37,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:37,956 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:37,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:37,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1347144672, now seen corresponding path program 1 times [2018-12-09 03:08:37,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:37,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:37,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:37,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:37,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:38,042 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 03:08:38,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:38,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:38,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:38,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:38,043 INFO L87 Difference]: Start difference. First operand 36568 states and 84950 transitions. Second operand 7 states. [2018-12-09 03:08:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:38,241 INFO L93 Difference]: Finished difference Result 38056 states and 88092 transitions. [2018-12-09 03:08:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:08:38,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 03:08:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:38,269 INFO L225 Difference]: With dead ends: 38056 [2018-12-09 03:08:38,269 INFO L226 Difference]: Without dead ends: 38056 [2018-12-09 03:08:38,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 03:08:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38056 states. [2018-12-09 03:08:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38056 to 36984. [2018-12-09 03:08:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36984 states. [2018-12-09 03:08:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36984 states to 36984 states and 85893 transitions. [2018-12-09 03:08:38,560 INFO L78 Accepts]: Start accepts. Automaton has 36984 states and 85893 transitions. Word has length 113 [2018-12-09 03:08:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:38,560 INFO L480 AbstractCegarLoop]: Abstraction has 36984 states and 85893 transitions. [2018-12-09 03:08:38,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 36984 states and 85893 transitions. [2018-12-09 03:08:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:38,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:38,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:38,584 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:38,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash -459640991, now seen corresponding path program 1 times [2018-12-09 03:08:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:38,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:38,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:38,654 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 03:08:38,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:38,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:38,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:38,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:38,655 INFO L87 Difference]: Start difference. First operand 36984 states and 85893 transitions. Second operand 7 states. [2018-12-09 03:08:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:38,807 INFO L93 Difference]: Finished difference Result 41640 states and 95502 transitions. [2018-12-09 03:08:38,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:38,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 03:08:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:38,837 INFO L225 Difference]: With dead ends: 41640 [2018-12-09 03:08:38,837 INFO L226 Difference]: Without dead ends: 41640 [2018-12-09 03:08:38,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:08:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41640 states. [2018-12-09 03:08:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41640 to 34916. [2018-12-09 03:08:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34916 states. [2018-12-09 03:08:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34916 states to 34916 states and 80709 transitions. [2018-12-09 03:08:39,170 INFO L78 Accepts]: Start accepts. Automaton has 34916 states and 80709 transitions. Word has length 113 [2018-12-09 03:08:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:39,170 INFO L480 AbstractCegarLoop]: Abstraction has 34916 states and 80709 transitions. [2018-12-09 03:08:39,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34916 states and 80709 transitions. [2018-12-09 03:08:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:39,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:39,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:39,195 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:39,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash -659675777, now seen corresponding path program 1 times [2018-12-09 03:08:39,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:39,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:39,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:39,271 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 03:08:39,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:39,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:39,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:39,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:39,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:39,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:39,272 INFO L87 Difference]: Start difference. First operand 34916 states and 80709 transitions. Second operand 7 states. [2018-12-09 03:08:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:39,604 INFO L93 Difference]: Finished difference Result 44220 states and 100049 transitions. [2018-12-09 03:08:39,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 03:08:39,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 03:08:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:39,636 INFO L225 Difference]: With dead ends: 44220 [2018-12-09 03:08:39,636 INFO L226 Difference]: Without dead ends: 44220 [2018-12-09 03:08:39,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:08:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44220 states. [2018-12-09 03:08:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44220 to 37036. [2018-12-09 03:08:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37036 states. [2018-12-09 03:08:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37036 states to 37036 states and 84570 transitions. [2018-12-09 03:08:40,063 INFO L78 Accepts]: Start accepts. Automaton has 37036 states and 84570 transitions. Word has length 113 [2018-12-09 03:08:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:40,064 INFO L480 AbstractCegarLoop]: Abstraction has 37036 states and 84570 transitions. [2018-12-09 03:08:40,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 37036 states and 84570 transitions. [2018-12-09 03:08:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:40,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:40,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:40,088 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:40,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash -448324864, now seen corresponding path program 1 times [2018-12-09 03:08:40,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:40,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:40,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:40,133 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 03:08:40,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:40,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:40,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:40,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:40,134 INFO L87 Difference]: Start difference. First operand 37036 states and 84570 transitions. Second operand 4 states. [2018-12-09 03:08:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:40,348 INFO L93 Difference]: Finished difference Result 44716 states and 102080 transitions. [2018-12-09 03:08:40,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:40,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-09 03:08:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:40,384 INFO L225 Difference]: With dead ends: 44716 [2018-12-09 03:08:40,384 INFO L226 Difference]: Without dead ends: 44716 [2018-12-09 03:08:40,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 03:08:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44716 states. [2018-12-09 03:08:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44716 to 36141. [2018-12-09 03:08:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36141 states. [2018-12-09 03:08:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36141 states to 36141 states and 82643 transitions. [2018-12-09 03:08:40,728 INFO L78 Accepts]: Start accepts. Automaton has 36141 states and 82643 transitions. Word has length 113 [2018-12-09 03:08:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:40,728 INFO L480 AbstractCegarLoop]: Abstraction has 36141 states and 82643 transitions. [2018-12-09 03:08:40,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 36141 states and 82643 transitions. [2018-12-09 03:08:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:40,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:40,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:40,754 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:40,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1840043908, now seen corresponding path program 1 times [2018-12-09 03:08:40,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:40,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:40,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:40,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:40,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:40,842 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 03:08:40,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:40,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 03:08:40,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:40,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 03:08:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 03:08:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:08:40,843 INFO L87 Difference]: Start difference. First operand 36141 states and 82643 transitions. Second operand 8 states. [2018-12-09 03:08:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:41,240 INFO L93 Difference]: Finished difference Result 42917 states and 97483 transitions. [2018-12-09 03:08:41,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:08:41,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 03:08:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:41,273 INFO L225 Difference]: With dead ends: 42917 [2018-12-09 03:08:41,273 INFO L226 Difference]: Without dead ends: 42917 [2018-12-09 03:08:41,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:08:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42917 states. [2018-12-09 03:08:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42917 to 37882. [2018-12-09 03:08:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37882 states. [2018-12-09 03:08:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37882 states to 37882 states and 86444 transitions. [2018-12-09 03:08:41,604 INFO L78 Accepts]: Start accepts. Automaton has 37882 states and 86444 transitions. Word has length 113 [2018-12-09 03:08:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:41,605 INFO L480 AbstractCegarLoop]: Abstraction has 37882 states and 86444 transitions. [2018-12-09 03:08:41,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 03:08:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 37882 states and 86444 transitions. [2018-12-09 03:08:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:41,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:41,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:41,630 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:41,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1690036726, now seen corresponding path program 2 times [2018-12-09 03:08:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:41,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:41,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:41,703 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 03:08:41,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:41,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 03:08:41,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:41,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 03:08:41,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 03:08:41,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:08:41,704 INFO L87 Difference]: Start difference. First operand 37882 states and 86444 transitions. Second operand 8 states. [2018-12-09 03:08:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:42,108 INFO L93 Difference]: Finished difference Result 45739 states and 103987 transitions. [2018-12-09 03:08:42,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 03:08:42,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 03:08:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:42,143 INFO L225 Difference]: With dead ends: 45739 [2018-12-09 03:08:42,143 INFO L226 Difference]: Without dead ends: 45739 [2018-12-09 03:08:42,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 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 03:08:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45739 states. [2018-12-09 03:08:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45739 to 36599. [2018-12-09 03:08:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36599 states. [2018-12-09 03:08:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36599 states to 36599 states and 83591 transitions. [2018-12-09 03:08:42,490 INFO L78 Accepts]: Start accepts. Automaton has 36599 states and 83591 transitions. Word has length 113 [2018-12-09 03:08:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:42,490 INFO L480 AbstractCegarLoop]: Abstraction has 36599 states and 83591 transitions. [2018-12-09 03:08:42,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 03:08:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 36599 states and 83591 transitions. [2018-12-09 03:08:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:42,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:42,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:42,516 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:42,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2008232095, now seen corresponding path program 1 times [2018-12-09 03:08:42,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:42,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:08:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:42,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:42,584 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 03:08:42,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:42,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 03:08:42,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:42,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 03:08:42,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 03:08:42,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:08:42,585 INFO L87 Difference]: Start difference. First operand 36599 states and 83591 transitions. Second operand 8 states. [2018-12-09 03:08:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:43,128 INFO L93 Difference]: Finished difference Result 51006 states and 116580 transitions. [2018-12-09 03:08:43,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 03:08:43,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 03:08:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:43,168 INFO L225 Difference]: With dead ends: 51006 [2018-12-09 03:08:43,168 INFO L226 Difference]: Without dead ends: 51006 [2018-12-09 03:08:43,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-09 03:08:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51006 states. [2018-12-09 03:08:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51006 to 36519. [2018-12-09 03:08:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36519 states. [2018-12-09 03:08:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36519 states to 36519 states and 83389 transitions. [2018-12-09 03:08:43,532 INFO L78 Accepts]: Start accepts. Automaton has 36519 states and 83389 transitions. Word has length 113 [2018-12-09 03:08:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:43,533 INFO L480 AbstractCegarLoop]: Abstraction has 36519 states and 83389 transitions. [2018-12-09 03:08:43,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 03:08:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 36519 states and 83389 transitions. [2018-12-09 03:08:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:08:43,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:43,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:43,558 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:43,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1632202250, now seen corresponding path program 3 times [2018-12-09 03:08:43,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:43,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:43,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:43,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:43,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:43,613 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 03:08:43,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:43,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:43,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:43,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:43,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:43,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:43,614 INFO L87 Difference]: Start difference. First operand 36519 states and 83389 transitions. Second operand 6 states. [2018-12-09 03:08:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:43,925 INFO L93 Difference]: Finished difference Result 41825 states and 94466 transitions. [2018-12-09 03:08:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:08:43,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-09 03:08:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:43,958 INFO L225 Difference]: With dead ends: 41825 [2018-12-09 03:08:43,958 INFO L226 Difference]: Without dead ends: 41805 [2018-12-09 03:08:43,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:08:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41805 states. [2018-12-09 03:08:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41805 to 37032. [2018-12-09 03:08:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37032 states. [2018-12-09 03:08:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37032 states to 37032 states and 84440 transitions. [2018-12-09 03:08:44,295 INFO L78 Accepts]: Start accepts. Automaton has 37032 states and 84440 transitions. Word has length 113 [2018-12-09 03:08:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:44,296 INFO L480 AbstractCegarLoop]: Abstraction has 37032 states and 84440 transitions. [2018-12-09 03:08:44,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 37032 states and 84440 transitions. [2018-12-09 03:08:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 03:08:44,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:44,322 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, 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 03:08:44,322 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:44,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash -116044119, now seen corresponding path program 1 times [2018-12-09 03:08:44,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:44,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:44,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:08:44,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:44,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:44,405 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 03:08:44,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:44,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 03:08:44,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:44,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 03:08:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 03:08:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:08:44,406 INFO L87 Difference]: Start difference. First operand 37032 states and 84440 transitions. Second operand 9 states. [2018-12-09 03:08:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:44,657 INFO L93 Difference]: Finished difference Result 63323 states and 145246 transitions. [2018-12-09 03:08:44,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 03:08:44,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-12-09 03:08:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:44,662 INFO L225 Difference]: With dead ends: 63323 [2018-12-09 03:08:44,663 INFO L226 Difference]: Without dead ends: 6981 [2018-12-09 03:08:44,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-09 03:08:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2018-12-09 03:08:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 6981. [2018-12-09 03:08:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6981 states. [2018-12-09 03:08:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 16457 transitions. [2018-12-09 03:08:44,709 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 16457 transitions. Word has length 115 [2018-12-09 03:08:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:44,709 INFO L480 AbstractCegarLoop]: Abstraction has 6981 states and 16457 transitions. [2018-12-09 03:08:44,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 03:08:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 16457 transitions. [2018-12-09 03:08:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 03:08:44,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:44,713 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, 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 03:08:44,713 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:44,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1850450446, now seen corresponding path program 1 times [2018-12-09 03:08:44,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:44,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:44,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:44,752 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 03:08:44,834 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 03:08:44,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:08:44 BasicIcfg [2018-12-09 03:08:44,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 03:08:44,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 03:08:44,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 03:08:44,836 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 03:08:44,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:20" (3/4) ... [2018-12-09 03:08:44,838 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 03:08:44,919 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e0877745-75ef-4da0-81f8-5ef61a5b7288/bin-2019/utaipan/witness.graphml [2018-12-09 03:08:44,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 03:08:44,920 INFO L168 Benchmark]: Toolchain (without parser) took 85316.89 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 948.1 MB in the beginning and 4.6 GB in the end (delta: -3.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,920 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 03:08:44,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,921 INFO L168 Benchmark]: Boogie Preprocessor took 20.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:44,921 INFO L168 Benchmark]: RCFGBuilder took 375.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.0 MB). Peak memory consumption was 63.0 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,921 INFO L168 Benchmark]: TraceAbstraction took 84476.21 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,921 INFO L168 Benchmark]: Witness Printer took 83.47 ms. Allocated memory is still 6.5 GB. Free memory was 4.7 GB in the beginning and 4.6 GB in the end (delta: 73.3 MB). Peak memory consumption was 73.3 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,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 328.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 375.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.0 MB). Peak memory consumption was 63.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84476.21 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 83.47 ms. Allocated memory is still 6.5 GB. Free memory was 4.7 GB in the beginning and 4.6 GB in the end (delta: 73.3 MB). Peak memory consumption was 73.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] -1 pthread_t t1735; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK -1 pthread_create(&t1735, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] -1 pthread_t t1736; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK -1 pthread_create(&t1736, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$w_buff1 = x$w_buff0 [L707] 0 x$w_buff0 = 1 [L708] 0 x$w_buff1_used = x$w_buff0_used [L709] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L711] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L712] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L713] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L714] 0 x$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 x$flush_delayed = weak$$choice2 [L720] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L722] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L723] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L724] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 x = x$flush_delayed ? x$mem_tmp : x [L730] 0 x$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 y = 1 [L753] 1 __unbuffered_p1_EAX = y [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L804] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L805] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L805] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L806] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L807] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L807] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 84.3s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 25.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14016 SDtfs, 16665 SDslu, 32283 SDs, 0 SdLazy, 11873 SolverSat, 790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 87 SyntacticMatches, 32 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred in iteration=6, 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: 47.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 697045 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2989 NumberOfCodeBlocks, 2989 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2841 ConstructedInterpolants, 0 QuantifiedInterpolants, 789295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...