./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015_tso.opt_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_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/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 3faba64a95a7a6525bff53cd761fa3b6c1f38d68 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-03 00:03:16,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 00:03:16,310 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 00:03:16,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 00:03:16,316 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 00:03:16,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 00:03:16,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 00:03:16,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 00:03:16,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 00:03:16,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 00:03:16,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 00:03:16,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 00:03:16,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 00:03:16,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 00:03:16,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 00:03:16,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 00:03:16,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 00:03:16,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 00:03:16,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 00:03:16,324 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 00:03:16,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 00:03:16,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 00:03:16,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 00:03:16,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 00:03:16,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 00:03:16,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 00:03:16,328 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 00:03:16,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 00:03:16,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 00:03:16,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 00:03:16,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 00:03:16,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 00:03:16,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 00:03:16,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 00:03:16,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 00:03:16,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 00:03:16,331 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 00:03:16,338 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 00:03:16,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 00:03:16,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 00:03:16,339 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 00:03:16,339 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 00:03:16,339 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 00:03:16,339 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 00:03:16,339 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 00:03:16,339 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 00:03:16,340 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 00:03:16,340 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 00:03:16,340 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 00:03:16,340 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 00:03:16,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 00:03:16,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 00:03:16,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 00:03:16,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 00:03:16,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 00:03:16,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 00:03:16,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 00:03:16,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 00:03:16,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 00:03:16,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 00:03:16,342 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 00:03:16,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 00:03:16,342 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 00:03:16,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 00:03:16,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 00:03:16,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 00:03:16,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 00:03:16,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 00:03:16,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 00:03:16,343 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 00:03:16,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 00:03:16,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 00:03:16,343 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 00:03:16,343 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_d258511f-247a-478a-9c4d-e0b8f395456d/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 -> 3faba64a95a7a6525bff53cd761fa3b6c1f38d68 [2018-12-03 00:03:16,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 00:03:16,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 00:03:16,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 00:03:16,375 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 00:03:16,375 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 00:03:16,376 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix015_tso.opt_false-unreach-call.i [2018-12-03 00:03:16,417 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/data/8cc18828e/390cf8f463f34b1aa6a4c678ea35709d/FLAG8a0794460 [2018-12-03 00:03:16,729 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 00:03:16,729 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/sv-benchmarks/c/pthread-wmm/mix015_tso.opt_false-unreach-call.i [2018-12-03 00:03:16,737 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/data/8cc18828e/390cf8f463f34b1aa6a4c678ea35709d/FLAG8a0794460 [2018-12-03 00:03:16,746 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/data/8cc18828e/390cf8f463f34b1aa6a4c678ea35709d [2018-12-03 00:03:16,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 00:03:16,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 00:03:16,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 00:03:16,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 00:03:16,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 00:03:16,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:03:16" (1/1) ... [2018-12-03 00:03:16,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:16, skipping insertion in model container [2018-12-03 00:03:16,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:03:16" (1/1) ... [2018-12-03 00:03:16,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 00:03:16,781 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 00:03:16,964 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:03:16,972 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 00:03:17,046 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:03:17,076 INFO L195 MainTranslator]: Completed translation [2018-12-03 00:03:17,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17 WrapperNode [2018-12-03 00:03:17,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 00:03:17,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 00:03:17,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 00:03:17,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 00:03:17,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 00:03:17,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 00:03:17,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 00:03:17,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 00:03:17,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... [2018-12-03 00:03:17,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 00:03:17,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 00:03:17,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 00:03:17,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 00:03:17,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/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-03 00:03:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 00:03:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 00:03:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 00:03:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 00:03:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 00:03:17,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 00:03:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 00:03:17,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 00:03:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 00:03:17,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 00:03:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 00:03:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 00:03:17,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 00:03:17,168 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 00:03:17,526 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 00:03:17,526 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 00:03:17,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:03:17 BoogieIcfgContainer [2018-12-03 00:03:17,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 00:03:17,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 00:03:17,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 00:03:17,529 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 00:03:17,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:03:16" (1/3) ... [2018-12-03 00:03:17,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4322203b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:03:17, skipping insertion in model container [2018-12-03 00:03:17,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:03:17" (2/3) ... [2018-12-03 00:03:17,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4322203b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:03:17, skipping insertion in model container [2018-12-03 00:03:17,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:03:17" (3/3) ... [2018-12-03 00:03:17,531 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015_tso.opt_false-unreach-call.i [2018-12-03 00:03:17,558 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,558 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,558 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,558 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,558 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,570 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,570 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,570 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,570 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 00:03:17,586 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 00:03:17,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 00:03:17,592 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 00:03:17,601 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 00:03:17,615 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 00:03:17,615 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 00:03:17,616 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 00:03:17,616 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 00:03:17,616 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 00:03:17,616 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 00:03:17,616 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 00:03:17,616 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 00:03:17,623 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 190places, 242 transitions [2018-12-03 00:05:30,581 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445147 states. [2018-12-03 00:05:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 445147 states. [2018-12-03 00:05:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 00:05:30,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:30,590 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-03 00:05:30,591 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:30,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash -339585471, now seen corresponding path program 1 times [2018-12-03 00:05:30,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:05:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:30,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:30,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:05:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:30,740 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-03 00:05:30,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:30,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:05:30,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:05:30,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:05:30,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:05:30,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:05:30,759 INFO L87 Difference]: Start difference. First operand 445147 states. Second operand 4 states. [2018-12-03 00:05:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:38,540 INFO L93 Difference]: Finished difference Result 810627 states and 3886644 transitions. [2018-12-03 00:05:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:05:38,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-03 00:05:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:40,113 INFO L225 Difference]: With dead ends: 810627 [2018-12-03 00:05:40,113 INFO L226 Difference]: Without dead ends: 530977 [2018-12-03 00:05:40,114 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-03 00:05:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530977 states. [2018-12-03 00:05:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530977 to 307957. [2018-12-03 00:05:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307957 states. [2018-12-03 00:06:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307957 states to 307957 states and 1493658 transitions. [2018-12-03 00:06:02,885 INFO L78 Accepts]: Start accepts. Automaton has 307957 states and 1493658 transitions. Word has length 48 [2018-12-03 00:06:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:02,886 INFO L480 AbstractCegarLoop]: Abstraction has 307957 states and 1493658 transitions. [2018-12-03 00:06:02,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:06:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 307957 states and 1493658 transitions. [2018-12-03 00:06:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 00:06:02,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:02,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:06:02,899 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:02,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash -48370061, now seen corresponding path program 1 times [2018-12-03 00:06:02,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:02,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:02,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:02,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:02,957 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-03 00:06:02,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:02,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:06:02,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:02,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:06:02,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:06:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:06:02,960 INFO L87 Difference]: Start difference. First operand 307957 states and 1493658 transitions. Second operand 3 states. [2018-12-03 00:06:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:05,151 INFO L93 Difference]: Finished difference Result 307957 states and 1492633 transitions. [2018-12-03 00:06:05,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:06:05,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 00:06:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:05,978 INFO L225 Difference]: With dead ends: 307957 [2018-12-03 00:06:05,978 INFO L226 Difference]: Without dead ends: 307957 [2018-12-03 00:06:05,979 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-03 00:06:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307957 states. [2018-12-03 00:06:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307957 to 307957. [2018-12-03 00:06:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307957 states. [2018-12-03 00:06:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307957 states to 307957 states and 1492633 transitions. [2018-12-03 00:06:19,497 INFO L78 Accepts]: Start accepts. Automaton has 307957 states and 1492633 transitions. Word has length 56 [2018-12-03 00:06:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:19,497 INFO L480 AbstractCegarLoop]: Abstraction has 307957 states and 1492633 transitions. [2018-12-03 00:06:19,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:06:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 307957 states and 1492633 transitions. [2018-12-03 00:06:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 00:06:19,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:19,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:06:19,504 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:19,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1694440274, now seen corresponding path program 1 times [2018-12-03 00:06:19,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:19,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:19,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:19,547 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-03 00:06:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:19,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:06:19,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:19,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:06:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:06:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:06:19,548 INFO L87 Difference]: Start difference. First operand 307957 states and 1492633 transitions. Second operand 4 states. [2018-12-03 00:06:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:21,242 INFO L93 Difference]: Finished difference Result 272411 states and 1286588 transitions. [2018-12-03 00:06:21,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:06:21,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-03 00:06:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:21,921 INFO L225 Difference]: With dead ends: 272411 [2018-12-03 00:06:21,922 INFO L226 Difference]: Without dead ends: 258311 [2018-12-03 00:06:21,922 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-03 00:06:30,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258311 states. [2018-12-03 00:06:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258311 to 258311. [2018-12-03 00:06:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258311 states. [2018-12-03 00:06:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258311 states to 258311 states and 1232395 transitions. [2018-12-03 00:06:33,748 INFO L78 Accepts]: Start accepts. Automaton has 258311 states and 1232395 transitions. Word has length 56 [2018-12-03 00:06:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:33,749 INFO L480 AbstractCegarLoop]: Abstraction has 258311 states and 1232395 transitions. [2018-12-03 00:06:33,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:06:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 258311 states and 1232395 transitions. [2018-12-03 00:06:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 00:06:33,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:33,755 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] [2018-12-03 00:06:33,755 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:33,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:33,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1611734580, now seen corresponding path program 1 times [2018-12-03 00:06:33,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:33,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:33,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:33,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:33,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:33,804 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-03 00:06:33,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:33,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:06:33,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:33,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:06:33,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:06:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:06:33,805 INFO L87 Difference]: Start difference. First operand 258311 states and 1232395 transitions. Second operand 5 states. [2018-12-03 00:06:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:34,440 INFO L93 Difference]: Finished difference Result 61671 states and 252911 transitions. [2018-12-03 00:06:34,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:06:34,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-03 00:06:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:34,551 INFO L225 Difference]: With dead ends: 61671 [2018-12-03 00:06:34,552 INFO L226 Difference]: Without dead ends: 49979 [2018-12-03 00:06:34,552 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-03 00:06:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49979 states. [2018-12-03 00:06:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49979 to 49519. [2018-12-03 00:06:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49519 states. [2018-12-03 00:06:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49519 states to 49519 states and 199433 transitions. [2018-12-03 00:06:35,228 INFO L78 Accepts]: Start accepts. Automaton has 49519 states and 199433 transitions. Word has length 57 [2018-12-03 00:06:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:35,229 INFO L480 AbstractCegarLoop]: Abstraction has 49519 states and 199433 transitions. [2018-12-03 00:06:35,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:06:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 49519 states and 199433 transitions. [2018-12-03 00:06:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 00:06:35,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:35,231 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] [2018-12-03 00:06:35,231 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:35,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash 828222952, now seen corresponding path program 1 times [2018-12-03 00:06:35,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:35,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:35,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:35,282 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-03 00:06:35,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:35,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:06:35,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:35,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:06:35,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:06:35,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:06:35,283 INFO L87 Difference]: Start difference. First operand 49519 states and 199433 transitions. Second operand 5 states. [2018-12-03 00:06:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:35,848 INFO L93 Difference]: Finished difference Result 100165 states and 398362 transitions. [2018-12-03 00:06:35,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:06:35,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-03 00:06:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:36,045 INFO L225 Difference]: With dead ends: 100165 [2018-12-03 00:06:36,045 INFO L226 Difference]: Without dead ends: 99790 [2018-12-03 00:06:36,046 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-03 00:06:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99790 states. [2018-12-03 00:06:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99790 to 66558. [2018-12-03 00:06:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66558 states. [2018-12-03 00:06:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66558 states to 66558 states and 261441 transitions. [2018-12-03 00:06:37,484 INFO L78 Accepts]: Start accepts. Automaton has 66558 states and 261441 transitions. Word has length 57 [2018-12-03 00:06:37,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:37,484 INFO L480 AbstractCegarLoop]: Abstraction has 66558 states and 261441 transitions. [2018-12-03 00:06:37,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:06:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 66558 states and 261441 transitions. [2018-12-03 00:06:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 00:06:37,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:37,487 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] [2018-12-03 00:06:37,487 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:37,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2059079538, now seen corresponding path program 1 times [2018-12-03 00:06:37,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:37,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:37,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:37,508 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-03 00:06:37,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:37,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:06:37,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:37,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:06:37,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:06:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:06:37,510 INFO L87 Difference]: Start difference. First operand 66558 states and 261441 transitions. Second operand 3 states. [2018-12-03 00:06:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:37,965 INFO L93 Difference]: Finished difference Result 122934 states and 477436 transitions. [2018-12-03 00:06:37,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:06:37,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 00:06:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:38,211 INFO L225 Difference]: With dead ends: 122934 [2018-12-03 00:06:38,211 INFO L226 Difference]: Without dead ends: 122914 [2018-12-03 00:06:38,212 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-03 00:06:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122914 states. [2018-12-03 00:06:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122914 to 103769. [2018-12-03 00:06:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103769 states. [2018-12-03 00:06:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103769 states to 103769 states and 403303 transitions. [2018-12-03 00:06:39,871 INFO L78 Accepts]: Start accepts. Automaton has 103769 states and 403303 transitions. Word has length 59 [2018-12-03 00:06:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:39,871 INFO L480 AbstractCegarLoop]: Abstraction has 103769 states and 403303 transitions. [2018-12-03 00:06:39,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:06:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 103769 states and 403303 transitions. [2018-12-03 00:06:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 00:06:39,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:39,878 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] [2018-12-03 00:06:39,878 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:39,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash 422957529, now seen corresponding path program 1 times [2018-12-03 00:06:39,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:39,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:39,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:39,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:39,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:39,960 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-03 00:06:39,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:39,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 00:06:39,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:39,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:06:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:06:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:06:39,961 INFO L87 Difference]: Start difference. First operand 103769 states and 403303 transitions. Second operand 8 states. [2018-12-03 00:06:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:41,086 INFO L93 Difference]: Finished difference Result 140479 states and 532646 transitions. [2018-12-03 00:06:41,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 00:06:41,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-12-03 00:06:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:41,364 INFO L225 Difference]: With dead ends: 140479 [2018-12-03 00:06:41,364 INFO L226 Difference]: Without dead ends: 140014 [2018-12-03 00:06:41,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-03 00:06:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140014 states. [2018-12-03 00:06:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140014 to 105818. [2018-12-03 00:06:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105818 states. [2018-12-03 00:06:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105818 states to 105818 states and 410088 transitions. [2018-12-03 00:06:44,760 INFO L78 Accepts]: Start accepts. Automaton has 105818 states and 410088 transitions. Word has length 63 [2018-12-03 00:06:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:44,760 INFO L480 AbstractCegarLoop]: Abstraction has 105818 states and 410088 transitions. [2018-12-03 00:06:44,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:06:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 105818 states and 410088 transitions. [2018-12-03 00:06:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 00:06:44,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:44,784 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-03 00:06:44,785 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:44,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1246120427, now seen corresponding path program 1 times [2018-12-03 00:06:44,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:44,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:44,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:44,843 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-03 00:06:44,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:44,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:06:44,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:44,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:06:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:06:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:06:44,844 INFO L87 Difference]: Start difference. First operand 105818 states and 410088 transitions. Second operand 6 states. [2018-12-03 00:06:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:46,397 INFO L93 Difference]: Finished difference Result 249350 states and 954618 transitions. [2018-12-03 00:06:46,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 00:06:46,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-03 00:06:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:46,921 INFO L225 Difference]: With dead ends: 249350 [2018-12-03 00:06:46,921 INFO L226 Difference]: Without dead ends: 249030 [2018-12-03 00:06:46,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 00:06:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249030 states. [2018-12-03 00:06:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249030 to 156108. [2018-12-03 00:06:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156108 states. [2018-12-03 00:06:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156108 states to 156108 states and 592792 transitions. [2018-12-03 00:06:49,822 INFO L78 Accepts]: Start accepts. Automaton has 156108 states and 592792 transitions. Word has length 74 [2018-12-03 00:06:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:49,822 INFO L480 AbstractCegarLoop]: Abstraction has 156108 states and 592792 transitions. [2018-12-03 00:06:49,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:06:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 156108 states and 592792 transitions. [2018-12-03 00:06:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 00:06:49,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:49,878 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] [2018-12-03 00:06:49,878 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:49,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1848798614, now seen corresponding path program 1 times [2018-12-03 00:06:49,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:49,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:49,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:49,944 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-03 00:06:49,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:49,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:06:49,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:49,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 00:06:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 00:06:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:06:49,945 INFO L87 Difference]: Start difference. First operand 156108 states and 592792 transitions. Second operand 7 states. [2018-12-03 00:06:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:51,810 INFO L93 Difference]: Finished difference Result 242605 states and 920052 transitions. [2018-12-03 00:06:51,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 00:06:51,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-03 00:06:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:52,350 INFO L225 Difference]: With dead ends: 242605 [2018-12-03 00:06:52,350 INFO L226 Difference]: Without dead ends: 241357 [2018-12-03 00:06:52,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-03 00:06:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241357 states. [2018-12-03 00:06:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241357 to 221191. [2018-12-03 00:06:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221191 states. [2018-12-03 00:06:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221191 states to 221191 states and 838930 transitions. [2018-12-03 00:06:58,304 INFO L78 Accepts]: Start accepts. Automaton has 221191 states and 838930 transitions. Word has length 81 [2018-12-03 00:06:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:58,304 INFO L480 AbstractCegarLoop]: Abstraction has 221191 states and 838930 transitions. [2018-12-03 00:06:58,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 00:06:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 221191 states and 838930 transitions. [2018-12-03 00:06:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 00:06:58,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:58,391 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] [2018-12-03 00:06:58,391 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:58,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:58,391 INFO L82 PathProgramCache]: Analyzing trace with hash 51847255, now seen corresponding path program 1 times [2018-12-03 00:06:58,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:06:58,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:58,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:58,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:58,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:06:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:58,473 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-03 00:06:58,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:58,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 00:06:58,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:06:58,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:06:58,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:06:58,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:06:58,474 INFO L87 Difference]: Start difference. First operand 221191 states and 838930 transitions. Second operand 8 states. [2018-12-03 00:07:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:00,389 INFO L93 Difference]: Finished difference Result 264605 states and 995964 transitions. [2018-12-03 00:07:00,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 00:07:00,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-12-03 00:07:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:00,983 INFO L225 Difference]: With dead ends: 264605 [2018-12-03 00:07:00,983 INFO L226 Difference]: Without dead ends: 264605 [2018-12-03 00:07:00,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 00:07:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264605 states. [2018-12-03 00:07:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264605 to 234279. [2018-12-03 00:07:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234279 states. [2018-12-03 00:07:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234279 states to 234279 states and 886386 transitions. [2018-12-03 00:07:05,021 INFO L78 Accepts]: Start accepts. Automaton has 234279 states and 886386 transitions. Word has length 81 [2018-12-03 00:07:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:05,021 INFO L480 AbstractCegarLoop]: Abstraction has 234279 states and 886386 transitions. [2018-12-03 00:07:05,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:07:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 234279 states and 886386 transitions. [2018-12-03 00:07:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 00:07:05,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:05,110 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] [2018-12-03 00:07:05,110 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:05,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash 939350936, now seen corresponding path program 1 times [2018-12-03 00:07:05,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:05,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:05,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:05,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:05,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:05,156 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-03 00:07:05,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:05,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:07:05,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:05,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:07:05,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:07:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:07:05,157 INFO L87 Difference]: Start difference. First operand 234279 states and 886386 transitions. Second operand 6 states. [2018-12-03 00:07:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:05,698 INFO L93 Difference]: Finished difference Result 73415 states and 243746 transitions. [2018-12-03 00:07:05,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:07:05,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-03 00:07:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:05,786 INFO L225 Difference]: With dead ends: 73415 [2018-12-03 00:07:05,786 INFO L226 Difference]: Without dead ends: 62727 [2018-12-03 00:07:05,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 00:07:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62727 states. [2018-12-03 00:07:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62727 to 42262. [2018-12-03 00:07:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42262 states. [2018-12-03 00:07:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42262 states to 42262 states and 141951 transitions. [2018-12-03 00:07:06,382 INFO L78 Accepts]: Start accepts. Automaton has 42262 states and 141951 transitions. Word has length 81 [2018-12-03 00:07:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:06,382 INFO L480 AbstractCegarLoop]: Abstraction has 42262 states and 141951 transitions. [2018-12-03 00:07:06,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:07:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 42262 states and 141951 transitions. [2018-12-03 00:07:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 00:07:06,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:06,419 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] [2018-12-03 00:07:06,419 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:06,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048315, now seen corresponding path program 1 times [2018-12-03 00:07:06,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:06,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:06,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:06,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:06,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:06,452 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-03 00:07:06,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:06,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:07:06,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:06,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:07:06,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:07:06,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:07:06,453 INFO L87 Difference]: Start difference. First operand 42262 states and 141951 transitions. Second operand 4 states. [2018-12-03 00:07:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:06,835 INFO L93 Difference]: Finished difference Result 82705 states and 268032 transitions. [2018-12-03 00:07:06,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:07:06,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-03 00:07:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:06,942 INFO L225 Difference]: With dead ends: 82705 [2018-12-03 00:07:06,943 INFO L226 Difference]: Without dead ends: 82705 [2018-12-03 00:07:06,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:07:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82705 states. [2018-12-03 00:07:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82705 to 62851. [2018-12-03 00:07:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62851 states. [2018-12-03 00:07:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62851 states to 62851 states and 207437 transitions. [2018-12-03 00:07:09,173 INFO L78 Accepts]: Start accepts. Automaton has 62851 states and 207437 transitions. Word has length 109 [2018-12-03 00:07:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:09,173 INFO L480 AbstractCegarLoop]: Abstraction has 62851 states and 207437 transitions. [2018-12-03 00:07:09,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:07:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 62851 states and 207437 transitions. [2018-12-03 00:07:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 00:07:09,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:09,237 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] [2018-12-03 00:07:09,238 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:09,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash 764283834, now seen corresponding path program 1 times [2018-12-03 00:07:09,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:09,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:09,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:09,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:09,279 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-03 00:07:09,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:09,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:07:09,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:09,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:07:09,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:07:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:07:09,280 INFO L87 Difference]: Start difference. First operand 62851 states and 207437 transitions. Second operand 4 states. [2018-12-03 00:07:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:09,606 INFO L93 Difference]: Finished difference Result 70247 states and 229701 transitions. [2018-12-03 00:07:09,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:07:09,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-03 00:07:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:09,698 INFO L225 Difference]: With dead ends: 70247 [2018-12-03 00:07:09,698 INFO L226 Difference]: Without dead ends: 70247 [2018-12-03 00:07:09,699 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-03 00:07:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70247 states. [2018-12-03 00:07:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70247 to 63521. [2018-12-03 00:07:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63521 states. [2018-12-03 00:07:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63521 states to 63521 states and 209723 transitions. [2018-12-03 00:07:10,648 INFO L78 Accepts]: Start accepts. Automaton has 63521 states and 209723 transitions. Word has length 109 [2018-12-03 00:07:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:10,648 INFO L480 AbstractCegarLoop]: Abstraction has 63521 states and 209723 transitions. [2018-12-03 00:07:10,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:07:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 63521 states and 209723 transitions. [2018-12-03 00:07:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 00:07:10,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:10,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] [2018-12-03 00:07:10,709 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:10,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:10,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1312925509, now seen corresponding path program 1 times [2018-12-03 00:07:10,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:10,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:10,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:10,741 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-03 00:07:10,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:10,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:07:10,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:10,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:07:10,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:07:10,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:07:10,742 INFO L87 Difference]: Start difference. First operand 63521 states and 209723 transitions. Second operand 3 states. [2018-12-03 00:07:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:11,069 INFO L93 Difference]: Finished difference Result 69221 states and 225203 transitions. [2018-12-03 00:07:11,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:07:11,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-12-03 00:07:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:11,157 INFO L225 Difference]: With dead ends: 69221 [2018-12-03 00:07:11,157 INFO L226 Difference]: Without dead ends: 69221 [2018-12-03 00:07:11,157 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-03 00:07:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69221 states. [2018-12-03 00:07:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69221 to 64461. [2018-12-03 00:07:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64461 states. [2018-12-03 00:07:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64461 states to 64461 states and 210815 transitions. [2018-12-03 00:07:11,963 INFO L78 Accepts]: Start accepts. Automaton has 64461 states and 210815 transitions. Word has length 109 [2018-12-03 00:07:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:11,963 INFO L480 AbstractCegarLoop]: Abstraction has 64461 states and 210815 transitions. [2018-12-03 00:07:11,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:07:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 64461 states and 210815 transitions. [2018-12-03 00:07:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 00:07:12,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:12,028 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] [2018-12-03 00:07:12,028 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:12,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:12,028 INFO L82 PathProgramCache]: Analyzing trace with hash 16633503, now seen corresponding path program 2 times [2018-12-03 00:07:12,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:12,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:12,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:12,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:12,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:12,112 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-03 00:07:12,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:12,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:07:12,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:12,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:07:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:07:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:07:12,113 INFO L87 Difference]: Start difference. First operand 64461 states and 210815 transitions. Second operand 6 states. [2018-12-03 00:07:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:12,508 INFO L93 Difference]: Finished difference Result 75321 states and 245209 transitions. [2018-12-03 00:07:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:07:12,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-03 00:07:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:12,606 INFO L225 Difference]: With dead ends: 75321 [2018-12-03 00:07:12,606 INFO L226 Difference]: Without dead ends: 75193 [2018-12-03 00:07:12,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:07:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75193 states. [2018-12-03 00:07:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75193 to 68750. [2018-12-03 00:07:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2018-12-03 00:07:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 224451 transitions. [2018-12-03 00:07:13,521 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 224451 transitions. Word has length 109 [2018-12-03 00:07:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:13,522 INFO L480 AbstractCegarLoop]: Abstraction has 68750 states and 224451 transitions. [2018-12-03 00:07:13,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:07:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 224451 transitions. [2018-12-03 00:07:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 00:07:13,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:13,591 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] [2018-12-03 00:07:13,592 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:13,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1780317856, now seen corresponding path program 1 times [2018-12-03 00:07:13,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:13,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:07:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:13,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:13,653 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-03 00:07:13,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:13,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:07:13,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:13,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 00:07:13,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 00:07:13,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:07:13,654 INFO L87 Difference]: Start difference. First operand 68750 states and 224451 transitions. Second operand 7 states. [2018-12-03 00:07:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:14,289 INFO L93 Difference]: Finished difference Result 96766 states and 315157 transitions. [2018-12-03 00:07:14,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 00:07:14,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-03 00:07:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:14,416 INFO L225 Difference]: With dead ends: 96766 [2018-12-03 00:07:14,416 INFO L226 Difference]: Without dead ends: 96766 [2018-12-03 00:07:14,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-03 00:07:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96766 states. [2018-12-03 00:07:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96766 to 71185. [2018-12-03 00:07:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71185 states. [2018-12-03 00:07:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71185 states to 71185 states and 232917 transitions. [2018-12-03 00:07:15,581 INFO L78 Accepts]: Start accepts. Automaton has 71185 states and 232917 transitions. Word has length 109 [2018-12-03 00:07:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:15,581 INFO L480 AbstractCegarLoop]: Abstraction has 71185 states and 232917 transitions. [2018-12-03 00:07:15,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 00:07:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 71185 states and 232917 transitions. [2018-12-03 00:07:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 00:07:15,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:15,655 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] [2018-12-03 00:07:15,655 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:15,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash -892814175, now seen corresponding path program 1 times [2018-12-03 00:07:15,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:15,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:15,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:15,709 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-03 00:07:15,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:15,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:07:15,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:15,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:07:15,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:07:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:07:15,710 INFO L87 Difference]: Start difference. First operand 71185 states and 232917 transitions. Second operand 6 states. [2018-12-03 00:07:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:16,323 INFO L93 Difference]: Finished difference Result 92552 states and 302905 transitions. [2018-12-03 00:07:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 00:07:16,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-03 00:07:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:16,458 INFO L225 Difference]: With dead ends: 92552 [2018-12-03 00:07:16,458 INFO L226 Difference]: Without dead ends: 92552 [2018-12-03 00:07:16,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 00:07:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92552 states. [2018-12-03 00:07:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92552 to 71275. [2018-12-03 00:07:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71275 states. [2018-12-03 00:07:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71275 states to 71275 states and 232859 transitions. [2018-12-03 00:07:17,486 INFO L78 Accepts]: Start accepts. Automaton has 71275 states and 232859 transitions. Word has length 109 [2018-12-03 00:07:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:17,486 INFO L480 AbstractCegarLoop]: Abstraction has 71275 states and 232859 transitions. [2018-12-03 00:07:17,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:07:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 71275 states and 232859 transitions. [2018-12-03 00:07:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 00:07:17,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:17,560 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] [2018-12-03 00:07:17,560 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:17,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash -8687217, now seen corresponding path program 1 times [2018-12-03 00:07:17,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:17,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:17,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:17,639 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-03 00:07:17,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:17,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:07:17,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:17,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 00:07:17,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 00:07:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:07:17,640 INFO L87 Difference]: Start difference. First operand 71275 states and 232859 transitions. Second operand 7 states. [2018-12-03 00:07:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:18,246 INFO L93 Difference]: Finished difference Result 96605 states and 312333 transitions. [2018-12-03 00:07:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 00:07:18,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-03 00:07:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:18,386 INFO L225 Difference]: With dead ends: 96605 [2018-12-03 00:07:18,387 INFO L226 Difference]: Without dead ends: 96605 [2018-12-03 00:07:18,387 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-03 00:07:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96605 states. [2018-12-03 00:07:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96605 to 82155. [2018-12-03 00:07:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82155 states. [2018-12-03 00:07:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82155 states to 82155 states and 267998 transitions. [2018-12-03 00:07:19,586 INFO L78 Accepts]: Start accepts. Automaton has 82155 states and 267998 transitions. Word has length 111 [2018-12-03 00:07:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:19,587 INFO L480 AbstractCegarLoop]: Abstraction has 82155 states and 267998 transitions. [2018-12-03 00:07:19,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 00:07:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 82155 states and 267998 transitions. [2018-12-03 00:07:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 00:07:19,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:19,678 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] [2018-12-03 00:07:19,679 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:19,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash -263423762, now seen corresponding path program 1 times [2018-12-03 00:07:19,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:19,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:19,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:19,757 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-03 00:07:19,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:19,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:07:19,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:19,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:07:19,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:07:19,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:07:19,758 INFO L87 Difference]: Start difference. First operand 82155 states and 267998 transitions. Second operand 6 states. [2018-12-03 00:07:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:20,066 INFO L93 Difference]: Finished difference Result 81067 states and 263374 transitions. [2018-12-03 00:07:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:07:20,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-12-03 00:07:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:20,170 INFO L225 Difference]: With dead ends: 81067 [2018-12-03 00:07:20,170 INFO L226 Difference]: Without dead ends: 81067 [2018-12-03 00:07:20,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:07:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81067 states. [2018-12-03 00:07:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81067 to 65493. [2018-12-03 00:07:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65493 states. [2018-12-03 00:07:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65493 states to 65493 states and 214190 transitions. [2018-12-03 00:07:21,086 INFO L78 Accepts]: Start accepts. Automaton has 65493 states and 214190 transitions. Word has length 111 [2018-12-03 00:07:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:21,086 INFO L480 AbstractCegarLoop]: Abstraction has 65493 states and 214190 transitions. [2018-12-03 00:07:21,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:07:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 65493 states and 214190 transitions. [2018-12-03 00:07:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 00:07:21,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:21,153 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] [2018-12-03 00:07:21,153 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:21,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash -90628208, now seen corresponding path program 1 times [2018-12-03 00:07:21,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:21,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:21,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:21,198 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-03 00:07:21,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:21,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:07:21,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:21,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:07:21,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:07:21,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:07:21,199 INFO L87 Difference]: Start difference. First operand 65493 states and 214190 transitions. Second operand 5 states. [2018-12-03 00:07:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:21,702 INFO L93 Difference]: Finished difference Result 80201 states and 258333 transitions. [2018-12-03 00:07:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:07:21,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-03 00:07:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:21,818 INFO L225 Difference]: With dead ends: 80201 [2018-12-03 00:07:21,818 INFO L226 Difference]: Without dead ends: 80201 [2018-12-03 00:07:21,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-03 00:07:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80201 states. [2018-12-03 00:07:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80201 to 68613. [2018-12-03 00:07:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68613 states. [2018-12-03 00:07:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68613 states to 68613 states and 223571 transitions. [2018-12-03 00:07:22,655 INFO L78 Accepts]: Start accepts. Automaton has 68613 states and 223571 transitions. Word has length 111 [2018-12-03 00:07:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:22,656 INFO L480 AbstractCegarLoop]: Abstraction has 68613 states and 223571 transitions. [2018-12-03 00:07:22,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:07:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 68613 states and 223571 transitions. [2018-12-03 00:07:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:22,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:22,728 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-03 00:07:22,728 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:22,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1967475405, now seen corresponding path program 1 times [2018-12-03 00:07:22,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:22,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:22,817 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-03 00:07:22,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:22,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:07:22,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:22,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 00:07:22,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 00:07:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:07:22,818 INFO L87 Difference]: Start difference. First operand 68613 states and 223571 transitions. Second operand 7 states. [2018-12-03 00:07:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:23,154 INFO L93 Difference]: Finished difference Result 72385 states and 234886 transitions. [2018-12-03 00:07:23,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 00:07:23,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-03 00:07:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:23,251 INFO L225 Difference]: With dead ends: 72385 [2018-12-03 00:07:23,251 INFO L226 Difference]: Without dead ends: 72385 [2018-12-03 00:07:23,251 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-03 00:07:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72385 states. [2018-12-03 00:07:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72385 to 71576. [2018-12-03 00:07:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71576 states. [2018-12-03 00:07:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71576 states to 71576 states and 232637 transitions. [2018-12-03 00:07:24,182 INFO L78 Accepts]: Start accepts. Automaton has 71576 states and 232637 transitions. Word has length 113 [2018-12-03 00:07:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:24,182 INFO L480 AbstractCegarLoop]: Abstraction has 71576 states and 232637 transitions. [2018-12-03 00:07:24,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 00:07:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 71576 states and 232637 transitions. [2018-12-03 00:07:24,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:24,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:24,258 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-03 00:07:24,259 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:24,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:24,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1439988210, now seen corresponding path program 1 times [2018-12-03 00:07:24,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:24,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:24,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:24,368 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-03 00:07:24,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:24,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 00:07:24,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:24,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 00:07:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 00:07:24,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-03 00:07:24,369 INFO L87 Difference]: Start difference. First operand 71576 states and 232637 transitions. Second operand 12 states. [2018-12-03 00:07:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:25,455 INFO L93 Difference]: Finished difference Result 140552 states and 452744 transitions. [2018-12-03 00:07:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 00:07:25,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-12-03 00:07:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:25,651 INFO L225 Difference]: With dead ends: 140552 [2018-12-03 00:07:25,651 INFO L226 Difference]: Without dead ends: 129220 [2018-12-03 00:07:25,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-12-03 00:07:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129220 states. [2018-12-03 00:07:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129220 to 94011. [2018-12-03 00:07:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94011 states. [2018-12-03 00:07:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94011 states to 94011 states and 307100 transitions. [2018-12-03 00:07:27,200 INFO L78 Accepts]: Start accepts. Automaton has 94011 states and 307100 transitions. Word has length 113 [2018-12-03 00:07:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:27,200 INFO L480 AbstractCegarLoop]: Abstraction has 94011 states and 307100 transitions. [2018-12-03 00:07:27,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 00:07:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 94011 states and 307100 transitions. [2018-12-03 00:07:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:27,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:27,315 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-03 00:07:27,315 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:27,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1682974836, now seen corresponding path program 2 times [2018-12-03 00:07:27,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:27,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:27,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:27,350 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-03 00:07:27,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:27,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:07:27,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:27,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:07:27,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:07:27,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:07:27,351 INFO L87 Difference]: Start difference. First operand 94011 states and 307100 transitions. Second operand 3 states. [2018-12-03 00:07:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:27,641 INFO L93 Difference]: Finished difference Result 98266 states and 319559 transitions. [2018-12-03 00:07:27,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:07:27,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-03 00:07:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:27,788 INFO L225 Difference]: With dead ends: 98266 [2018-12-03 00:07:27,788 INFO L226 Difference]: Without dead ends: 98266 [2018-12-03 00:07:27,788 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-03 00:07:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98266 states. [2018-12-03 00:07:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98266 to 97571. [2018-12-03 00:07:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97571 states. [2018-12-03 00:07:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97571 states to 97571 states and 317548 transitions. [2018-12-03 00:07:29,267 INFO L78 Accepts]: Start accepts. Automaton has 97571 states and 317548 transitions. Word has length 113 [2018-12-03 00:07:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:29,267 INFO L480 AbstractCegarLoop]: Abstraction has 97571 states and 317548 transitions. [2018-12-03 00:07:29,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:07:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 97571 states and 317548 transitions. [2018-12-03 00:07:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:29,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:29,386 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-03 00:07:29,386 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:29,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1836320102, now seen corresponding path program 3 times [2018-12-03 00:07:29,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:29,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:07:29,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:29,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:29,500 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-03 00:07:29,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:29,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 00:07:29,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:29,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 00:07:29,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 00:07:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-03 00:07:29,501 INFO L87 Difference]: Start difference. First operand 97571 states and 317548 transitions. Second operand 13 states. [2018-12-03 00:07:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:31,418 INFO L93 Difference]: Finished difference Result 185992 states and 605755 transitions. [2018-12-03 00:07:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 00:07:31,418 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2018-12-03 00:07:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:31,679 INFO L225 Difference]: With dead ends: 185992 [2018-12-03 00:07:31,679 INFO L226 Difference]: Without dead ends: 159501 [2018-12-03 00:07:31,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-12-03 00:07:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159501 states. [2018-12-03 00:07:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159501 to 127706. [2018-12-03 00:07:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127706 states. [2018-12-03 00:07:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127706 states to 127706 states and 418141 transitions. [2018-12-03 00:07:33,573 INFO L78 Accepts]: Start accepts. Automaton has 127706 states and 418141 transitions. Word has length 113 [2018-12-03 00:07:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:33,574 INFO L480 AbstractCegarLoop]: Abstraction has 127706 states and 418141 transitions. [2018-12-03 00:07:33,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 00:07:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 127706 states and 418141 transitions. [2018-12-03 00:07:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:33,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:33,737 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-03 00:07:33,737 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:33,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash -89858118, now seen corresponding path program 4 times [2018-12-03 00:07:33,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:33,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:07:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:33,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:33,769 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-03 00:07:33,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:33,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:07:33,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:33,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:07:33,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:07:33,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:07:33,770 INFO L87 Difference]: Start difference. First operand 127706 states and 418141 transitions. Second operand 3 states. [2018-12-03 00:07:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:34,207 INFO L93 Difference]: Finished difference Result 146581 states and 479131 transitions. [2018-12-03 00:07:34,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:07:34,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-03 00:07:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:34,441 INFO L225 Difference]: With dead ends: 146581 [2018-12-03 00:07:34,441 INFO L226 Difference]: Without dead ends: 146581 [2018-12-03 00:07:34,441 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-03 00:07:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146581 states. [2018-12-03 00:07:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146581 to 146156. [2018-12-03 00:07:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146156 states. [2018-12-03 00:07:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146156 states to 146156 states and 477881 transitions. [2018-12-03 00:07:36,411 INFO L78 Accepts]: Start accepts. Automaton has 146156 states and 477881 transitions. Word has length 113 [2018-12-03 00:07:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:36,411 INFO L480 AbstractCegarLoop]: Abstraction has 146156 states and 477881 transitions. [2018-12-03 00:07:36,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:07:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 146156 states and 477881 transitions. [2018-12-03 00:07:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:36,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:36,604 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-03 00:07:36,604 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:36,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash -78541991, now seen corresponding path program 1 times [2018-12-03 00:07:36,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:36,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:36,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:36,672 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-03 00:07:36,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:36,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:07:36,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:36,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:07:36,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:07:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:07:36,672 INFO L87 Difference]: Start difference. First operand 146156 states and 477881 transitions. Second operand 4 states. [2018-12-03 00:07:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:37,175 INFO L93 Difference]: Finished difference Result 149056 states and 484586 transitions. [2018-12-03 00:07:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:07:37,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-03 00:07:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:37,415 INFO L225 Difference]: With dead ends: 149056 [2018-12-03 00:07:37,415 INFO L226 Difference]: Without dead ends: 149056 [2018-12-03 00:07:37,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:07:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149056 states. [2018-12-03 00:07:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149056 to 146576. [2018-12-03 00:07:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146576 states. [2018-12-03 00:07:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146576 states to 146576 states and 477217 transitions. [2018-12-03 00:07:39,477 INFO L78 Accepts]: Start accepts. Automaton has 146576 states and 477217 transitions. Word has length 113 [2018-12-03 00:07:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:39,477 INFO L480 AbstractCegarLoop]: Abstraction has 146576 states and 477217 transitions. [2018-12-03 00:07:39,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:07:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 146576 states and 477217 transitions. [2018-12-03 00:07:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:39,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:39,668 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-03 00:07:39,668 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:39,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1104033990, now seen corresponding path program 1 times [2018-12-03 00:07:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:39,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:39,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:39,757 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-03 00:07:39,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:39,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 00:07:39,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:39,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 00:07:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 00:07:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:07:39,758 INFO L87 Difference]: Start difference. First operand 146576 states and 477217 transitions. Second operand 10 states. [2018-12-03 00:07:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:41,030 INFO L93 Difference]: Finished difference Result 198892 states and 645258 transitions. [2018-12-03 00:07:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 00:07:41,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-03 00:07:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:41,126 INFO L225 Difference]: With dead ends: 198892 [2018-12-03 00:07:41,126 INFO L226 Difference]: Without dead ends: 68656 [2018-12-03 00:07:41,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-03 00:07:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68656 states. [2018-12-03 00:07:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68656 to 68656. [2018-12-03 00:07:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68656 states. [2018-12-03 00:07:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68656 states to 68656 states and 208821 transitions. [2018-12-03 00:07:41,840 INFO L78 Accepts]: Start accepts. Automaton has 68656 states and 208821 transitions. Word has length 113 [2018-12-03 00:07:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:41,840 INFO L480 AbstractCegarLoop]: Abstraction has 68656 states and 208821 transitions. [2018-12-03 00:07:41,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 00:07:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 68656 states and 208821 transitions. [2018-12-03 00:07:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:41,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:41,905 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-03 00:07:41,906 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:41,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:41,906 INFO L82 PathProgramCache]: Analyzing trace with hash 652208486, now seen corresponding path program 2 times [2018-12-03 00:07:41,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:41,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:41,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:41,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:41,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:41,979 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-03 00:07:41,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:41,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 00:07:41,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:41,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:07:41,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:07:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:07:41,980 INFO L87 Difference]: Start difference. First operand 68656 states and 208821 transitions. Second operand 8 states. [2018-12-03 00:07:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:42,500 INFO L93 Difference]: Finished difference Result 86323 states and 265183 transitions. [2018-12-03 00:07:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 00:07:42,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-03 00:07:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:42,520 INFO L225 Difference]: With dead ends: 86323 [2018-12-03 00:07:42,520 INFO L226 Difference]: Without dead ends: 17258 [2018-12-03 00:07:42,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-03 00:07:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17258 states. [2018-12-03 00:07:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17258 to 17256. [2018-12-03 00:07:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17256 states. [2018-12-03 00:07:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17256 states to 17256 states and 55598 transitions. [2018-12-03 00:07:42,688 INFO L78 Accepts]: Start accepts. Automaton has 17256 states and 55598 transitions. Word has length 113 [2018-12-03 00:07:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:42,689 INFO L480 AbstractCegarLoop]: Abstraction has 17256 states and 55598 transitions. [2018-12-03 00:07:42,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:07:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 17256 states and 55598 transitions. [2018-12-03 00:07:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:42,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:42,703 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-03 00:07:42,703 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:42,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1990998278, now seen corresponding path program 1 times [2018-12-03 00:07:42,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:42,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:07:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:42,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:42,800 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-03 00:07:42,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:42,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 00:07:42,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:42,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 00:07:42,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 00:07:42,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 00:07:42,801 INFO L87 Difference]: Start difference. First operand 17256 states and 55598 transitions. Second operand 12 states. [2018-12-03 00:07:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:43,357 INFO L93 Difference]: Finished difference Result 25783 states and 81696 transitions. [2018-12-03 00:07:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 00:07:43,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-12-03 00:07:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:43,388 INFO L225 Difference]: With dead ends: 25783 [2018-12-03 00:07:43,388 INFO L226 Difference]: Without dead ends: 25783 [2018-12-03 00:07:43,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-12-03 00:07:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25783 states. [2018-12-03 00:07:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25783 to 19515. [2018-12-03 00:07:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19515 states. [2018-12-03 00:07:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19515 states to 19515 states and 62609 transitions. [2018-12-03 00:07:43,612 INFO L78 Accepts]: Start accepts. Automaton has 19515 states and 62609 transitions. Word has length 113 [2018-12-03 00:07:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:43,613 INFO L480 AbstractCegarLoop]: Abstraction has 19515 states and 62609 transitions. [2018-12-03 00:07:43,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 00:07:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 19515 states and 62609 transitions. [2018-12-03 00:07:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:43,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:43,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:07:43,629 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:43,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:43,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1103494597, now seen corresponding path program 1 times [2018-12-03 00:07:43,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:43,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:43,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:43,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:43,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:07:43,760 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-03 00:07:43,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:07:43,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 00:07:43,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:07:43,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 00:07:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 00:07:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-03 00:07:43,761 INFO L87 Difference]: Start difference. First operand 19515 states and 62609 transitions. Second operand 13 states. [2018-12-03 00:07:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:07:44,371 INFO L93 Difference]: Finished difference Result 29743 states and 94026 transitions. [2018-12-03 00:07:44,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 00:07:44,372 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2018-12-03 00:07:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:07:44,398 INFO L225 Difference]: With dead ends: 29743 [2018-12-03 00:07:44,398 INFO L226 Difference]: Without dead ends: 22913 [2018-12-03 00:07:44,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-03 00:07:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22913 states. [2018-12-03 00:07:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22913 to 19802. [2018-12-03 00:07:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19802 states. [2018-12-03 00:07:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19802 states to 19802 states and 63328 transitions. [2018-12-03 00:07:44,607 INFO L78 Accepts]: Start accepts. Automaton has 19802 states and 63328 transitions. Word has length 113 [2018-12-03 00:07:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:07:44,607 INFO L480 AbstractCegarLoop]: Abstraction has 19802 states and 63328 transitions. [2018-12-03 00:07:44,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 00:07:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19802 states and 63328 transitions. [2018-12-03 00:07:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 00:07:44,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:07:44,624 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-03 00:07:44,624 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:07:44,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:07:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1575828745, now seen corresponding path program 2 times [2018-12-03 00:07:44,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:07:44,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:07:44,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:07:44,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:07:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:07:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:07:44,666 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 00:07:44,754 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 00:07:44,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:07:44 BasicIcfg [2018-12-03 00:07:44,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 00:07:44,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 00:07:44,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 00:07:44,756 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 00:07:44,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:03:17" (3/4) ... [2018-12-03 00:07:44,757 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 00:07:44,843 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d258511f-247a-478a-9c4d-e0b8f395456d/bin-2019/utaipan/witness.graphml [2018-12-03 00:07:44,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 00:07:44,844 INFO L168 Benchmark]: Toolchain (without parser) took 268095.93 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.3 GB). Free memory was 948.1 MB in the beginning and 5.1 GB in the end (delta: -4.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-03 00:07:44,845 INFO L168 Benchmark]: CDTParser took 0.16 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-03 00:07:44,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-03 00:07:44,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.75 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-03 00:07:44,845 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 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-03 00:07:44,845 INFO L168 Benchmark]: RCFGBuilder took 393.05 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: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. [2018-12-03 00:07:44,845 INFO L168 Benchmark]: TraceAbstraction took 267228.40 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: -4.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-03 00:07:44,846 INFO L168 Benchmark]: Witness Printer took 88.06 ms. Allocated memory is still 7.3 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 76.3 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. [2018-12-03 00:07:44,847 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.16 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.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.75 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.73 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 393.05 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: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 267228.40 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: -4.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 88.06 ms. Allocated memory is still 7.3 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 76.3 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L682] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L684] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L685] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L686] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L688] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L690] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L692] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L693] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L694] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L695] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L696] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L697] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L698] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L699] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L700] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L701] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L702] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L703] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L704] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L705] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L706] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L707] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L708] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L709] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L710] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] -1 pthread_t t408; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK -1 pthread_create(&t408, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] -1 pthread_t t409; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK -1 pthread_create(&t409, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] -1 pthread_t t410; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK -1 pthread_create(&t410, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 0 z$w_buff1 = z$w_buff0 [L764] 0 z$w_buff0 = 1 [L765] 0 z$w_buff1_used = z$w_buff0_used [L766] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L769] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L770] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L771] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L772] 0 z$r_buff0_thd3 = (_Bool)1 [L775] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L776] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L777] 0 z$flush_delayed = weak$$choice2 [L778] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 0 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 0 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 0 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L785] EXPR 0 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z = z$flush_delayed ? z$mem_tmp : z [L788] 0 z$flush_delayed = (_Bool)0 [L791] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L714] 1 a = 1 [L717] 1 x = 1 [L720] 1 __unbuffered_p0_EAX = x [L723] 1 __unbuffered_p0_EBX = y [L728] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 2 y = 1 [L738] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L739] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L740] 2 z$flush_delayed = weak$$choice2 [L741] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L743] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L745] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L748] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z = z$flush_delayed ? z$mem_tmp : z [L751] 2 z$flush_delayed = (_Bool)0 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 305 locations, 3 error locations. UNSAFE Result, 267.1s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 39.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12106 SDtfs, 14923 SDslu, 38911 SDs, 0 SdLazy, 12404 SolverSat, 536 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 98 SyntacticMatches, 14 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445147occurred in iteration=0, 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: 89.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 680979 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2943 NumberOfCodeBlocks, 2943 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2800 ConstructedInterpolants, 0 QuantifiedInterpolants, 708946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...