./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_rmo.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_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc28bb760373a1c30fb22cb571f76934eae5a007 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 11:19:04,554 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 11:19:04,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 11:19:04,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 11:19:04,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 11:19:04,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 11:19:04,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 11:19:04,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 11:19:04,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 11:19:04,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 11:19:04,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 11:19:04,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 11:19:04,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 11:19:04,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 11:19:04,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 11:19:04,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 11:19:04,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 11:19:04,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 11:19:04,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 11:19:04,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 11:19:04,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 11:19:04,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 11:19:04,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 11:19:04,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 11:19:04,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 11:19:04,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 11:19:04,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 11:19:04,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 11:19:04,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 11:19:04,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 11:19:04,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 11:19:04,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 11:19:04,581 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 11:19:04,581 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 11:19:04,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 11:19:04,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 11:19:04,582 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 11:19:04,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 11:19:04,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 11:19:04,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 11:19:04,593 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 11:19:04,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 11:19:04,593 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 11:19:04,593 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 11:19:04,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 11:19:04,594 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 11:19:04,595 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 11:19:04,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 11:19:04,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 11:19:04,595 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 11:19:04,595 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 11:19:04,595 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 11:19:04,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 11:19:04,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 11:19:04,596 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 11:19:04,596 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 11:19:04,596 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 11:19:04,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 11:19:04,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 11:19:04,596 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer 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 -> Automizer 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 -> bc28bb760373a1c30fb22cb571f76934eae5a007 [2018-12-08 11:19:04,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 11:19:04,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 11:19:04,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 11:19:04,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 11:19:04,621 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 11:19:04,622 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i [2018-12-08 11:19:04,653 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/data/13dd845f2/cfcea053e74c470ba075e7e63add6b50/FLAG5a18aba9f [2018-12-08 11:19:05,054 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 11:19:05,055 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i [2018-12-08 11:19:05,063 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/data/13dd845f2/cfcea053e74c470ba075e7e63add6b50/FLAG5a18aba9f [2018-12-08 11:19:05,071 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/data/13dd845f2/cfcea053e74c470ba075e7e63add6b50 [2018-12-08 11:19:05,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 11:19:05,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 11:19:05,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 11:19:05,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 11:19:05,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 11:19:05,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05, skipping insertion in model container [2018-12-08 11:19:05,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 11:19:05,105 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 11:19:05,286 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:19:05,294 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 11:19:05,372 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:19:05,402 INFO L195 MainTranslator]: Completed translation [2018-12-08 11:19:05,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05 WrapperNode [2018-12-08 11:19:05,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 11:19:05,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 11:19:05,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 11:19:05,403 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 11:19:05,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 11:19:05,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 11:19:05,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 11:19:05,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 11:19:05,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... [2018-12-08 11:19:05,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 11:19:05,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 11:19:05,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 11:19:05,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 11:19:05,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/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-08 11:19:05,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 11:19:05,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 11:19:05,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 11:19:05,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 11:19:05,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 11:19:05,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 11:19:05,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 11:19:05,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 11:19:05,515 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 11:19:05,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 11:19:05,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 11:19:05,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 11:19:05,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 11:19:05,516 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 11:19:05,869 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 11:19:05,870 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 11:19:05,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:19:05 BoogieIcfgContainer [2018-12-08 11:19:05,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 11:19:05,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 11:19:05,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 11:19:05,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 11:19:05,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:19:05" (1/3) ... [2018-12-08 11:19:05,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459c595c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:19:05, skipping insertion in model container [2018-12-08 11:19:05,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:19:05" (2/3) ... [2018-12-08 11:19:05,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459c595c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:19:05, skipping insertion in model container [2018-12-08 11:19:05,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:19:05" (3/3) ... [2018-12-08 11:19:05,875 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_rmo.opt_false-unreach-call.i [2018-12-08 11:19:05,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,903 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,903 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,905 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,905 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,905 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,905 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,906 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,906 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,910 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,911 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,912 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,913 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,913 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,913 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,913 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,913 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,913 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,913 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,913 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,914 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,915 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,916 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,916 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,916 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,916 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,916 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,916 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,916 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,916 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:19:05,934 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 11:19:05,934 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 11:19:05,941 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 11:19:05,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 11:19:05,967 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 11:19:05,968 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 11:19:05,968 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 11:19:05,968 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 11:19:05,968 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 11:19:05,968 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 11:19:05,968 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 11:19:05,968 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 11:19:05,968 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 11:19:05,978 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 189places, 241 transitions [2018-12-08 11:21:37,308 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445146 states. [2018-12-08 11:21:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 445146 states. [2018-12-08 11:21:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 11:21:37,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:21:37,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:21:37,323 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:21:37,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:21:37,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1446185373, now seen corresponding path program 1 times [2018-12-08 11:21:37,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:21:37,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:21:37,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:21:37,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:21:37,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:21:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:21:37,474 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-08 11:21:37,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:21:37,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:21:37,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:21:37,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:21:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:21:37,487 INFO L87 Difference]: Start difference. First operand 445146 states. Second operand 4 states. [2018-12-08 11:21:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:21:46,093 INFO L93 Difference]: Finished difference Result 810626 states and 3886643 transitions. [2018-12-08 11:21:46,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:21:46,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 11:21:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:21:48,412 INFO L225 Difference]: With dead ends: 810626 [2018-12-08 11:21:48,412 INFO L226 Difference]: Without dead ends: 530976 [2018-12-08 11:21:48,413 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-08 11:21:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530976 states. [2018-12-08 11:22:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530976 to 307956. [2018-12-08 11:22:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307956 states. [2018-12-08 11:22:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307956 states to 307956 states and 1493657 transitions. [2018-12-08 11:22:12,992 INFO L78 Accepts]: Start accepts. Automaton has 307956 states and 1493657 transitions. Word has length 47 [2018-12-08 11:22:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:12,993 INFO L480 AbstractCegarLoop]: Abstraction has 307956 states and 1493657 transitions. [2018-12-08 11:22:12,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:22:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 307956 states and 1493657 transitions. [2018-12-08 11:22:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 11:22:13,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:13,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:22:13,004 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:13,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:13,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1064613016, now seen corresponding path program 1 times [2018-12-08 11:22:13,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:13,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:13,066 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-08 11:22:13,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:13,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:22:13,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:22:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:22:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:22:13,068 INFO L87 Difference]: Start difference. First operand 307956 states and 1493657 transitions. Second operand 4 states. [2018-12-08 11:22:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:14,425 INFO L93 Difference]: Finished difference Result 272410 states and 1287431 transitions. [2018-12-08 11:22:14,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:22:14,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-08 11:22:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:16,006 INFO L225 Difference]: With dead ends: 272410 [2018-12-08 11:22:16,007 INFO L226 Difference]: Without dead ends: 258310 [2018-12-08 11:22:16,007 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-08 11:22:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258310 states. [2018-12-08 11:22:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258310 to 258310. [2018-12-08 11:22:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258310 states. [2018-12-08 11:22:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258310 states to 258310 states and 1233238 transitions. [2018-12-08 11:22:28,860 INFO L78 Accepts]: Start accepts. Automaton has 258310 states and 1233238 transitions. Word has length 55 [2018-12-08 11:22:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:28,860 INFO L480 AbstractCegarLoop]: Abstraction has 258310 states and 1233238 transitions. [2018-12-08 11:22:28,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:22:28,861 INFO L276 IsEmpty]: Start isEmpty. Operand 258310 states and 1233238 transitions. [2018-12-08 11:22:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 11:22:28,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:28,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:22:28,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:28,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1750301674, now seen corresponding path program 1 times [2018-12-08 11:22:28,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:28,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:28,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:28,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:28,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:28,916 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-08 11:22:28,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:28,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:22:28,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:22:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:22:28,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:22:28,917 INFO L87 Difference]: Start difference. First operand 258310 states and 1233238 transitions. Second operand 5 states. [2018-12-08 11:22:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:29,174 INFO L93 Difference]: Finished difference Result 61670 states and 253006 transitions. [2018-12-08 11:22:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:22:29,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-08 11:22:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:29,277 INFO L225 Difference]: With dead ends: 61670 [2018-12-08 11:22:29,277 INFO L226 Difference]: Without dead ends: 49978 [2018-12-08 11:22:29,277 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-08 11:22:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2018-12-08 11:22:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49518. [2018-12-08 11:22:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49518 states. [2018-12-08 11:22:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49518 states to 49518 states and 199528 transitions. [2018-12-08 11:22:30,396 INFO L78 Accepts]: Start accepts. Automaton has 49518 states and 199528 transitions. Word has length 56 [2018-12-08 11:22:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:30,397 INFO L480 AbstractCegarLoop]: Abstraction has 49518 states and 199528 transitions. [2018-12-08 11:22:30,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:22:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 49518 states and 199528 transitions. [2018-12-08 11:22:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 11:22:30,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:30,400 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-08 11:22:30,400 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:30,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2065306486, now seen corresponding path program 1 times [2018-12-08 11:22:30,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:30,459 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-08 11:22:30,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:30,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:22:30,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:22:30,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:22:30,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:22:30,460 INFO L87 Difference]: Start difference. First operand 49518 states and 199528 transitions. Second operand 5 states. [2018-12-08 11:22:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:31,030 INFO L93 Difference]: Finished difference Result 100164 states and 398537 transitions. [2018-12-08 11:22:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:22:31,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-08 11:22:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:31,242 INFO L225 Difference]: With dead ends: 100164 [2018-12-08 11:22:31,242 INFO L226 Difference]: Without dead ends: 99789 [2018-12-08 11:22:31,243 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-08 11:22:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99789 states. [2018-12-08 11:22:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99789 to 66557. [2018-12-08 11:22:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66557 states. [2018-12-08 11:22:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66557 states to 66557 states and 261584 transitions. [2018-12-08 11:22:34,437 INFO L78 Accepts]: Start accepts. Automaton has 66557 states and 261584 transitions. Word has length 56 [2018-12-08 11:22:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:34,437 INFO L480 AbstractCegarLoop]: Abstraction has 66557 states and 261584 transitions. [2018-12-08 11:22:34,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:22:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 66557 states and 261584 transitions. [2018-12-08 11:22:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 11:22:34,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:34,441 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] [2018-12-08 11:22:34,441 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:34,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:34,441 INFO L82 PathProgramCache]: Analyzing trace with hash 397938288, now seen corresponding path program 1 times [2018-12-08 11:22:34,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:34,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:34,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:34,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:34,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:34,461 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-08 11:22:34,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:34,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:22:34,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:22:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:22:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:22:34,462 INFO L87 Difference]: Start difference. First operand 66557 states and 261584 transitions. Second operand 3 states. [2018-12-08 11:22:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:34,924 INFO L93 Difference]: Finished difference Result 122933 states and 477675 transitions. [2018-12-08 11:22:34,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:22:34,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-08 11:22:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:35,182 INFO L225 Difference]: With dead ends: 122933 [2018-12-08 11:22:35,183 INFO L226 Difference]: Without dead ends: 122913 [2018-12-08 11:22:35,183 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-08 11:22:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122913 states. [2018-12-08 11:22:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122913 to 103768. [2018-12-08 11:22:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103768 states. [2018-12-08 11:22:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103768 states to 103768 states and 403446 transitions. [2018-12-08 11:22:36,920 INFO L78 Accepts]: Start accepts. Automaton has 103768 states and 403446 transitions. Word has length 58 [2018-12-08 11:22:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:36,920 INFO L480 AbstractCegarLoop]: Abstraction has 103768 states and 403446 transitions. [2018-12-08 11:22:36,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:22:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 103768 states and 403446 transitions. [2018-12-08 11:22:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 11:22:36,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:36,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:22:36,928 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:36,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash -549306821, now seen corresponding path program 1 times [2018-12-08 11:22:36,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:36,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:36,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:36,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:37,023 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-08 11:22:37,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:37,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:22:37,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:22:37,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:22:37,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:22:37,024 INFO L87 Difference]: Start difference. First operand 103768 states and 403446 transitions. Second operand 8 states. [2018-12-08 11:22:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:38,196 INFO L93 Difference]: Finished difference Result 140478 states and 532789 transitions. [2018-12-08 11:22:38,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 11:22:38,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-08 11:22:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:38,493 INFO L225 Difference]: With dead ends: 140478 [2018-12-08 11:22:38,493 INFO L226 Difference]: Without dead ends: 140013 [2018-12-08 11:22:38,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-08 11:22:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140013 states. [2018-12-08 11:22:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140013 to 105817. [2018-12-08 11:22:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105817 states. [2018-12-08 11:22:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105817 states to 105817 states and 410167 transitions. [2018-12-08 11:22:40,400 INFO L78 Accepts]: Start accepts. Automaton has 105817 states and 410167 transitions. Word has length 62 [2018-12-08 11:22:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:40,401 INFO L480 AbstractCegarLoop]: Abstraction has 105817 states and 410167 transitions. [2018-12-08 11:22:40,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:22:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 105817 states and 410167 transitions. [2018-12-08 11:22:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 11:22:40,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:40,653 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] [2018-12-08 11:22:40,654 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:40,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 74113855, now seen corresponding path program 1 times [2018-12-08 11:22:40,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:40,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:40,683 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-08 11:22:40,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:40,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:22:40,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:22:40,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:22:40,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:22:40,684 INFO L87 Difference]: Start difference. First operand 105817 states and 410167 transitions. Second operand 4 states. [2018-12-08 11:22:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:41,284 INFO L93 Difference]: Finished difference Result 134671 states and 525470 transitions. [2018-12-08 11:22:41,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:22:41,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-08 11:22:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:41,567 INFO L225 Difference]: With dead ends: 134671 [2018-12-08 11:22:41,568 INFO L226 Difference]: Without dead ends: 134671 [2018-12-08 11:22:41,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:22:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134671 states. [2018-12-08 11:22:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134671 to 122063. [2018-12-08 11:22:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122063 states. [2018-12-08 11:22:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122063 states to 122063 states and 473790 transitions. [2018-12-08 11:22:43,571 INFO L78 Accepts]: Start accepts. Automaton has 122063 states and 473790 transitions. Word has length 73 [2018-12-08 11:22:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:43,571 INFO L480 AbstractCegarLoop]: Abstraction has 122063 states and 473790 transitions. [2018-12-08 11:22:43,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:22:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 122063 states and 473790 transitions. [2018-12-08 11:22:43,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 11:22:43,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:43,603 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] [2018-12-08 11:22:43,603 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:43,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1816924190, now seen corresponding path program 1 times [2018-12-08 11:22:43,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:43,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:43,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:22:43,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:43,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:22:43,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:22:43,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:22:43,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:22:43,655 INFO L87 Difference]: Start difference. First operand 122063 states and 473790 transitions. Second operand 6 states. [2018-12-08 11:22:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:43,846 INFO L93 Difference]: Finished difference Result 51087 states and 174606 transitions. [2018-12-08 11:22:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:22:43,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-08 11:22:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:43,916 INFO L225 Difference]: With dead ends: 51087 [2018-12-08 11:22:43,916 INFO L226 Difference]: Without dead ends: 44303 [2018-12-08 11:22:43,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:22:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44303 states. [2018-12-08 11:22:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44303 to 38118. [2018-12-08 11:22:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38118 states. [2018-12-08 11:22:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38118 states to 38118 states and 128492 transitions. [2018-12-08 11:22:44,626 INFO L78 Accepts]: Start accepts. Automaton has 38118 states and 128492 transitions. Word has length 73 [2018-12-08 11:22:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:44,627 INFO L480 AbstractCegarLoop]: Abstraction has 38118 states and 128492 transitions. [2018-12-08 11:22:44,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:22:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 38118 states and 128492 transitions. [2018-12-08 11:22:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 11:22:44,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:44,661 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] [2018-12-08 11:22:44,661 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:44,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1298061300, now seen corresponding path program 1 times [2018-12-08 11:22:44,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:44,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:44,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:44,717 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-08 11:22:44,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:44,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:22:44,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:22:44,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:22:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:22:44,717 INFO L87 Difference]: Start difference. First operand 38118 states and 128492 transitions. Second operand 4 states. [2018-12-08 11:22:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:44,963 INFO L93 Difference]: Finished difference Result 44328 states and 147355 transitions. [2018-12-08 11:22:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:22:44,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-08 11:22:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:45,021 INFO L225 Difference]: With dead ends: 44328 [2018-12-08 11:22:45,021 INFO L226 Difference]: Without dead ends: 44328 [2018-12-08 11:22:45,022 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-08 11:22:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44328 states. [2018-12-08 11:22:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44328 to 41995. [2018-12-08 11:22:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41995 states. [2018-12-08 11:22:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41995 states to 41995 states and 140228 transitions. [2018-12-08 11:22:45,527 INFO L78 Accepts]: Start accepts. Automaton has 41995 states and 140228 transitions. Word has length 108 [2018-12-08 11:22:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:45,528 INFO L480 AbstractCegarLoop]: Abstraction has 41995 states and 140228 transitions. [2018-12-08 11:22:45,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:22:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41995 states and 140228 transitions. [2018-12-08 11:22:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 11:22:45,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:45,568 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] [2018-12-08 11:22:45,569 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:45,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash 919696653, now seen corresponding path program 1 times [2018-12-08 11:22:45,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:45,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:45,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:45,603 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-08 11:22:45,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:45,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:22:45,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:22:45,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:22:45,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:22:45,603 INFO L87 Difference]: Start difference. First operand 41995 states and 140228 transitions. Second operand 3 states. [2018-12-08 11:22:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:45,886 INFO L93 Difference]: Finished difference Result 57485 states and 189945 transitions. [2018-12-08 11:22:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:22:45,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-12-08 11:22:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:45,968 INFO L225 Difference]: With dead ends: 57485 [2018-12-08 11:22:45,968 INFO L226 Difference]: Without dead ends: 57485 [2018-12-08 11:22:45,969 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-08 11:22:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57485 states. [2018-12-08 11:22:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57485 to 51445. [2018-12-08 11:22:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51445 states. [2018-12-08 11:22:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51445 states to 51445 states and 171388 transitions. [2018-12-08 11:22:46,698 INFO L78 Accepts]: Start accepts. Automaton has 51445 states and 171388 transitions. Word has length 108 [2018-12-08 11:22:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:46,698 INFO L480 AbstractCegarLoop]: Abstraction has 51445 states and 171388 transitions. [2018-12-08 11:22:46,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:22:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 51445 states and 171388 transitions. [2018-12-08 11:22:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 11:22:46,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:46,754 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] [2018-12-08 11:22:46,754 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:46,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:46,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1110537687, now seen corresponding path program 2 times [2018-12-08 11:22:46,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:46,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:46,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:46,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:46,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:46,823 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-08 11:22:46,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:46,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:22:46,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:22:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:22:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:22:46,824 INFO L87 Difference]: Start difference. First operand 51445 states and 171388 transitions. Second operand 5 states. [2018-12-08 11:22:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:47,233 INFO L93 Difference]: Finished difference Result 65127 states and 212743 transitions. [2018-12-08 11:22:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:22:47,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-12-08 11:22:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:47,330 INFO L225 Difference]: With dead ends: 65127 [2018-12-08 11:22:47,330 INFO L226 Difference]: Without dead ends: 65127 [2018-12-08 11:22:47,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:22:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65127 states. [2018-12-08 11:22:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65127 to 55880. [2018-12-08 11:22:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55880 states. [2018-12-08 11:22:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55880 states to 55880 states and 184886 transitions. [2018-12-08 11:22:48,087 INFO L78 Accepts]: Start accepts. Automaton has 55880 states and 184886 transitions. Word has length 108 [2018-12-08 11:22:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:48,087 INFO L480 AbstractCegarLoop]: Abstraction has 55880 states and 184886 transitions. [2018-12-08 11:22:48,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:22:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 55880 states and 184886 transitions. [2018-12-08 11:22:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 11:22:48,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:48,148 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] [2018-12-08 11:22:48,148 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:48,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:48,148 INFO L82 PathProgramCache]: Analyzing trace with hash -411744613, now seen corresponding path program 3 times [2018-12-08 11:22:48,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:48,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:48,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:48,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:22:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:48,186 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-08 11:22:48,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:48,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:22:48,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:22:48,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:22:48,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:22:48,187 INFO L87 Difference]: Start difference. First operand 55880 states and 184886 transitions. Second operand 4 states. [2018-12-08 11:22:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:48,423 INFO L93 Difference]: Finished difference Result 56712 states and 187654 transitions. [2018-12-08 11:22:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:22:48,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-08 11:22:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:48,591 INFO L225 Difference]: With dead ends: 56712 [2018-12-08 11:22:48,591 INFO L226 Difference]: Without dead ends: 56712 [2018-12-08 11:22:48,591 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-08 11:22:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56712 states. [2018-12-08 11:22:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56712 to 56136. [2018-12-08 11:22:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56136 states. [2018-12-08 11:22:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56136 states to 56136 states and 185782 transitions. [2018-12-08 11:22:49,227 INFO L78 Accepts]: Start accepts. Automaton has 56136 states and 185782 transitions. Word has length 108 [2018-12-08 11:22:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:49,227 INFO L480 AbstractCegarLoop]: Abstraction has 56136 states and 185782 transitions. [2018-12-08 11:22:49,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:22:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 56136 states and 185782 transitions. [2018-12-08 11:22:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 11:22:49,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:49,288 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] [2018-12-08 11:22:49,288 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:49,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2075768220, now seen corresponding path program 1 times [2018-12-08 11:22:49,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:49,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:49,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:22:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:49,367 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-08 11:22:49,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:49,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:22:49,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:22:49,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:22:49,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:22:49,368 INFO L87 Difference]: Start difference. First operand 56136 states and 185782 transitions. Second operand 6 states. [2018-12-08 11:22:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:49,539 INFO L93 Difference]: Finished difference Result 55944 states and 184646 transitions. [2018-12-08 11:22:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:22:49,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-12-08 11:22:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:49,618 INFO L225 Difference]: With dead ends: 55944 [2018-12-08 11:22:49,618 INFO L226 Difference]: Without dead ends: 55944 [2018-12-08 11:22:49,619 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-08 11:22:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55944 states. [2018-12-08 11:22:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55944 to 52207. [2018-12-08 11:22:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52207 states. [2018-12-08 11:22:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52207 states to 52207 states and 173146 transitions. [2018-12-08 11:22:50,447 INFO L78 Accepts]: Start accepts. Automaton has 52207 states and 173146 transitions. Word has length 108 [2018-12-08 11:22:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:50,448 INFO L480 AbstractCegarLoop]: Abstraction has 52207 states and 173146 transitions. [2018-12-08 11:22:50,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:22:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 52207 states and 173146 transitions. [2018-12-08 11:22:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:22:50,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:50,504 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] [2018-12-08 11:22:50,504 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:50,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1888864614, now seen corresponding path program 1 times [2018-12-08 11:22:50,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:50,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:50,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:50,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:50,575 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-08 11:22:50,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:50,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:22:50,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:22:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:22:50,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:22:50,576 INFO L87 Difference]: Start difference. First operand 52207 states and 173146 transitions. Second operand 8 states. [2018-12-08 11:22:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:51,758 INFO L93 Difference]: Finished difference Result 99910 states and 325515 transitions. [2018-12-08 11:22:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 11:22:51,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-12-08 11:22:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:51,920 INFO L225 Difference]: With dead ends: 99910 [2018-12-08 11:22:51,920 INFO L226 Difference]: Without dead ends: 99455 [2018-12-08 11:22:51,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-12-08 11:22:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99455 states. [2018-12-08 11:22:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99455 to 74582. [2018-12-08 11:22:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74582 states. [2018-12-08 11:22:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74582 states to 74582 states and 247121 transitions. [2018-12-08 11:22:53,193 INFO L78 Accepts]: Start accepts. Automaton has 74582 states and 247121 transitions. Word has length 110 [2018-12-08 11:22:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:53,193 INFO L480 AbstractCegarLoop]: Abstraction has 74582 states and 247121 transitions. [2018-12-08 11:22:53,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:22:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 74582 states and 247121 transitions. [2018-12-08 11:22:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:22:53,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:53,274 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] [2018-12-08 11:22:53,275 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:53,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash 328893339, now seen corresponding path program 1 times [2018-12-08 11:22:53,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:53,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:53,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:53,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:53,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:53,384 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-08 11:22:53,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:53,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:22:53,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:22:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:22:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:22:53,385 INFO L87 Difference]: Start difference. First operand 74582 states and 247121 transitions. Second operand 7 states. [2018-12-08 11:22:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:54,105 INFO L93 Difference]: Finished difference Result 116727 states and 374727 transitions. [2018-12-08 11:22:54,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 11:22:54,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-08 11:22:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:54,296 INFO L225 Difference]: With dead ends: 116727 [2018-12-08 11:22:54,296 INFO L226 Difference]: Without dead ends: 116727 [2018-12-08 11:22:54,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:22:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116727 states. [2018-12-08 11:22:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116727 to 94602. [2018-12-08 11:22:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94602 states. [2018-12-08 11:22:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94602 states to 94602 states and 308197 transitions. [2018-12-08 11:22:55,826 INFO L78 Accepts]: Start accepts. Automaton has 94602 states and 308197 transitions. Word has length 110 [2018-12-08 11:22:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:55,826 INFO L480 AbstractCegarLoop]: Abstraction has 94602 states and 308197 transitions. [2018-12-08 11:22:55,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:22:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 94602 states and 308197 transitions. [2018-12-08 11:22:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:22:55,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:55,946 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] [2018-12-08 11:22:55,946 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:55,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash 540244252, now seen corresponding path program 1 times [2018-12-08 11:22:55,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:55,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:55,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:56,048 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-08 11:22:56,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:56,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:22:56,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:22:56,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:22:56,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:22:56,049 INFO L87 Difference]: Start difference. First operand 94602 states and 308197 transitions. Second operand 7 states. [2018-12-08 11:22:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:56,557 INFO L93 Difference]: Finished difference Result 98264 states and 319154 transitions. [2018-12-08 11:22:56,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 11:22:56,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-08 11:22:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:56,713 INFO L225 Difference]: With dead ends: 98264 [2018-12-08 11:22:56,713 INFO L226 Difference]: Without dead ends: 98264 [2018-12-08 11:22:56,714 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-08 11:22:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98264 states. [2018-12-08 11:22:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98264 to 97455. [2018-12-08 11:22:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97455 states. [2018-12-08 11:22:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97455 states to 97455 states and 316905 transitions. [2018-12-08 11:22:58,072 INFO L78 Accepts]: Start accepts. Automaton has 97455 states and 316905 transitions. Word has length 110 [2018-12-08 11:22:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:22:58,072 INFO L480 AbstractCegarLoop]: Abstraction has 97455 states and 316905 transitions. [2018-12-08 11:22:58,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:22:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 97455 states and 316905 transitions. [2018-12-08 11:22:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:22:58,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:22:58,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:22:58,195 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:22:58,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:22:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1427747933, now seen corresponding path program 1 times [2018-12-08 11:22:58,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:22:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:22:58,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:58,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:22:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:22:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:22:58,245 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-08 11:22:58,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:22:58,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:22:58,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:22:58,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:22:58,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:22:58,247 INFO L87 Difference]: Start difference. First operand 97455 states and 316905 transitions. Second operand 4 states. [2018-12-08 11:22:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:22:58,881 INFO L93 Difference]: Finished difference Result 128678 states and 420430 transitions. [2018-12-08 11:22:58,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:22:58,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-08 11:22:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:22:59,095 INFO L225 Difference]: With dead ends: 128678 [2018-12-08 11:22:59,095 INFO L226 Difference]: Without dead ends: 128678 [2018-12-08 11:22:59,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:22:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128678 states. [2018-12-08 11:23:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128678 to 93800. [2018-12-08 11:23:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93800 states. [2018-12-08 11:23:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93800 states to 93800 states and 305171 transitions. [2018-12-08 11:23:00,604 INFO L78 Accepts]: Start accepts. Automaton has 93800 states and 305171 transitions. Word has length 110 [2018-12-08 11:23:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:23:00,605 INFO L480 AbstractCegarLoop]: Abstraction has 93800 states and 305171 transitions. [2018-12-08 11:23:00,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:23:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 93800 states and 305171 transitions. [2018-12-08 11:23:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:23:00,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:23:00,720 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] [2018-12-08 11:23:00,720 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:23:00,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:23:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash -637899201, now seen corresponding path program 2 times [2018-12-08 11:23:00,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:23:00,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:23:00,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:00,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:23:00,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:23:00,764 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-08 11:23:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:23:00,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:23:00,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:23:00,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:23:00,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:23:00,765 INFO L87 Difference]: Start difference. First operand 93800 states and 305171 transitions. Second operand 5 states. [2018-12-08 11:23:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:23:01,273 INFO L93 Difference]: Finished difference Result 103018 states and 332542 transitions. [2018-12-08 11:23:01,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:23:01,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-08 11:23:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:23:01,441 INFO L225 Difference]: With dead ends: 103018 [2018-12-08 11:23:01,441 INFO L226 Difference]: Without dead ends: 103018 [2018-12-08 11:23:01,441 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-08 11:23:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103018 states. [2018-12-08 11:23:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103018 to 96815. [2018-12-08 11:23:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96815 states. [2018-12-08 11:23:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96815 states to 96815 states and 314243 transitions. [2018-12-08 11:23:02,797 INFO L78 Accepts]: Start accepts. Automaton has 96815 states and 314243 transitions. Word has length 110 [2018-12-08 11:23:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:23:02,797 INFO L480 AbstractCegarLoop]: Abstraction has 96815 states and 314243 transitions. [2018-12-08 11:23:02,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:23:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 96815 states and 314243 transitions. [2018-12-08 11:23:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:23:02,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:23:02,918 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] [2018-12-08 11:23:02,919 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:23:02,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:23:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1032658435, now seen corresponding path program 3 times [2018-12-08 11:23:02,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:23:02,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:23:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:02,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:23:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:23:02,942 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-08 11:23:02,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:23:02,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:23:02,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:23:02,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:23:02,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:23:02,942 INFO L87 Difference]: Start difference. First operand 96815 states and 314243 transitions. Second operand 3 states. [2018-12-08 11:23:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:23:03,320 INFO L93 Difference]: Finished difference Result 116755 states and 378120 transitions. [2018-12-08 11:23:03,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:23:03,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-08 11:23:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:23:03,510 INFO L225 Difference]: With dead ends: 116755 [2018-12-08 11:23:03,510 INFO L226 Difference]: Without dead ends: 116755 [2018-12-08 11:23:03,511 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-08 11:23:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116755 states. [2018-12-08 11:23:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116755 to 116350. [2018-12-08 11:23:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116350 states. [2018-12-08 11:23:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116350 states to 116350 states and 376936 transitions. [2018-12-08 11:23:05,098 INFO L78 Accepts]: Start accepts. Automaton has 116350 states and 376936 transitions. Word has length 110 [2018-12-08 11:23:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:23:05,098 INFO L480 AbstractCegarLoop]: Abstraction has 116350 states and 376936 transitions. [2018-12-08 11:23:05,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:23:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 116350 states and 376936 transitions. [2018-12-08 11:23:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:23:05,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:23:05,247 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] [2018-12-08 11:23:05,248 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:23:05,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:23:05,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1244009348, now seen corresponding path program 1 times [2018-12-08 11:23:05,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:23:05,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:23:05,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:05,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:23:05,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:23:05,317 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-08 11:23:05,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:23:05,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:23:05,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:23:05,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:23:05,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:23:05,318 INFO L87 Difference]: Start difference. First operand 116350 states and 376936 transitions. Second operand 6 states. [2018-12-08 11:23:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:23:06,343 INFO L93 Difference]: Finished difference Result 137108 states and 443419 transitions. [2018-12-08 11:23:06,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:23:06,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-08 11:23:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:23:06,540 INFO L225 Difference]: With dead ends: 137108 [2018-12-08 11:23:06,540 INFO L226 Difference]: Without dead ends: 137108 [2018-12-08 11:23:06,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:23:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137108 states. [2018-12-08 11:23:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137108 to 116525. [2018-12-08 11:23:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116525 states. [2018-12-08 11:23:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116525 states to 116525 states and 377451 transitions. [2018-12-08 11:23:08,408 INFO L78 Accepts]: Start accepts. Automaton has 116525 states and 377451 transitions. Word has length 110 [2018-12-08 11:23:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:23:08,409 INFO L480 AbstractCegarLoop]: Abstraction has 116525 states and 377451 transitions. [2018-12-08 11:23:08,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:23:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 116525 states and 377451 transitions. [2018-12-08 11:23:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 11:23:08,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:23:08,550 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] [2018-12-08 11:23:08,550 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:23:08,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:23:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash 312737698, now seen corresponding path program 1 times [2018-12-08 11:23:08,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:23:08,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:23:08,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:08,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:23:08,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:23:08,647 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-08 11:23:08,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:23:08,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 11:23:08,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 11:23:08,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 11:23:08,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 11:23:08,647 INFO L87 Difference]: Start difference. First operand 116525 states and 377451 transitions. Second operand 10 states. [2018-12-08 11:23:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:23:09,603 INFO L93 Difference]: Finished difference Result 171629 states and 553403 transitions. [2018-12-08 11:23:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:23:09,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-12-08 11:23:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:23:09,701 INFO L225 Difference]: With dead ends: 171629 [2018-12-08 11:23:09,701 INFO L226 Difference]: Without dead ends: 66869 [2018-12-08 11:23:09,702 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-08 11:23:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66869 states. [2018-12-08 11:23:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66869 to 66869. [2018-12-08 11:23:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66869 states. [2018-12-08 11:23:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66869 states to 66869 states and 207759 transitions. [2018-12-08 11:23:10,461 INFO L78 Accepts]: Start accepts. Automaton has 66869 states and 207759 transitions. Word has length 112 [2018-12-08 11:23:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:23:10,461 INFO L480 AbstractCegarLoop]: Abstraction has 66869 states and 207759 transitions. [2018-12-08 11:23:10,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 11:23:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 66869 states and 207759 transitions. [2018-12-08 11:23:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 11:23:12,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:23:12,126 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] [2018-12-08 11:23:12,126 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:23:12,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:23:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 207315942, now seen corresponding path program 2 times [2018-12-08 11:23:12,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:23:12,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:23:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:12,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:23:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:23:12,183 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-08 11:23:12,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:23:12,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:23:12,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:23:12,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:23:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:23:12,184 INFO L87 Difference]: Start difference. First operand 66869 states and 207759 transitions. Second operand 7 states. [2018-12-08 11:23:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:23:12,637 INFO L93 Difference]: Finished difference Result 84255 states and 263472 transitions. [2018-12-08 11:23:12,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:23:12,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-08 11:23:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:23:12,658 INFO L225 Difference]: With dead ends: 84255 [2018-12-08 11:23:12,658 INFO L226 Difference]: Without dead ends: 17031 [2018-12-08 11:23:12,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-08 11:23:12,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17031 states. [2018-12-08 11:23:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17031 to 17029. [2018-12-08 11:23:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17029 states. [2018-12-08 11:23:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17029 states to 17029 states and 55039 transitions. [2018-12-08 11:23:12,833 INFO L78 Accepts]: Start accepts. Automaton has 17029 states and 55039 transitions. Word has length 112 [2018-12-08 11:23:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:23:12,833 INFO L480 AbstractCegarLoop]: Abstraction has 17029 states and 55039 transitions. [2018-12-08 11:23:12,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:23:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17029 states and 55039 transitions. [2018-12-08 11:23:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 11:23:12,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:23:12,849 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] [2018-12-08 11:23:12,849 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:23:12,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:23:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash 816097090, now seen corresponding path program 1 times [2018-12-08 11:23:12,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:23:12,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:23:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:12,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:23:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:23:12,943 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-08 11:23:12,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:23:12,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 11:23:12,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 11:23:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 11:23:12,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-08 11:23:12,944 INFO L87 Difference]: Start difference. First operand 17029 states and 55039 transitions. Second operand 11 states. [2018-12-08 11:23:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:23:13,345 INFO L93 Difference]: Finished difference Result 23024 states and 73119 transitions. [2018-12-08 11:23:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 11:23:13,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-12-08 11:23:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:23:13,370 INFO L225 Difference]: With dead ends: 23024 [2018-12-08 11:23:13,370 INFO L226 Difference]: Without dead ends: 23024 [2018-12-08 11:23:13,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-08 11:23:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23024 states. [2018-12-08 11:23:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23024 to 16907. [2018-12-08 11:23:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16907 states. [2018-12-08 11:23:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16907 states to 16907 states and 54681 transitions. [2018-12-08 11:23:13,567 INFO L78 Accepts]: Start accepts. Automaton has 16907 states and 54681 transitions. Word has length 112 [2018-12-08 11:23:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:23:13,567 INFO L480 AbstractCegarLoop]: Abstraction has 16907 states and 54681 transitions. [2018-12-08 11:23:13,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 11:23:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 54681 transitions. [2018-12-08 11:23:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 11:23:13,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:23:13,582 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] [2018-12-08 11:23:13,582 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:23:13,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:23:13,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1129786526, now seen corresponding path program 3 times [2018-12-08 11:23:13,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:23:13,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:23:13,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:13,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:23:13,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:23:13,718 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-08 11:23:13,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:23:13,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 11:23:13,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 11:23:13,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 11:23:13,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 11:23:13,718 INFO L87 Difference]: Start difference. First operand 16907 states and 54681 transitions. Second operand 13 states. [2018-12-08 11:23:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:23:14,235 INFO L93 Difference]: Finished difference Result 26916 states and 85550 transitions. [2018-12-08 11:23:14,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 11:23:14,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-12-08 11:23:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:23:14,259 INFO L225 Difference]: With dead ends: 26916 [2018-12-08 11:23:14,260 INFO L226 Difference]: Without dead ends: 20138 [2018-12-08 11:23:14,260 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-08 11:23:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20138 states. [2018-12-08 11:23:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20138 to 17254. [2018-12-08 11:23:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17254 states. [2018-12-08 11:23:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 55530 transitions. [2018-12-08 11:23:14,448 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 55530 transitions. Word has length 112 [2018-12-08 11:23:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:23:14,449 INFO L480 AbstractCegarLoop]: Abstraction has 17254 states and 55530 transitions. [2018-12-08 11:23:14,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 11:23:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 55530 transitions. [2018-12-08 11:23:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 11:23:14,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:23:14,464 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] [2018-12-08 11:23:14,464 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:23:14,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:23:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1172321924, now seen corresponding path program 4 times [2018-12-08 11:23:14,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:23:14,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:23:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:14,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:23:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:23:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:23:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:23:14,509 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 11:23:14,596 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 11:23:14,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 11:23:14 BasicIcfg [2018-12-08 11:23:14,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 11:23:14,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 11:23:14,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 11:23:14,597 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 11:23:14,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:19:05" (3/4) ... [2018-12-08 11:23:14,599 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 11:23:14,727 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8b50197f-de98-4b45-99af-72bd0962e94e/bin-2019/uautomizer/witness.graphml [2018-12-08 11:23:14,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 11:23:14,728 INFO L168 Benchmark]: Toolchain (without parser) took 249654.49 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 950.6 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-08 11:23:14,730 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:23:14,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-08 11:23:14,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:23:14,730 INFO L168 Benchmark]: Boogie Preprocessor took 29.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:23:14,730 INFO L168 Benchmark]: RCFGBuilder took 393.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2018-12-08 11:23:14,731 INFO L168 Benchmark]: TraceAbstraction took 248726.13 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-08 11:23:14,731 INFO L168 Benchmark]: Witness Printer took 130.23 ms. Allocated memory is still 7.1 GB. Free memory was 3.9 GB in the beginning and 5.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2018-12-08 11:23:14,732 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 393.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 248726.13 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 130.23 ms. Allocated memory is still 7.1 GB. Free memory was 3.9 GB in the beginning and 5.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 60.8 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L690] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L693] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L694] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L695] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L696] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L697] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L698] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L699] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L700] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L701] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L702] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L703] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L704] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L705] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L706] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L814] -1 pthread_t t298; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L815] FCALL, FORK -1 pthread_create(&t298, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L816] -1 pthread_t t299; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L817] FCALL, FORK -1 pthread_create(&t299, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L818] -1 pthread_t t300; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L819] FCALL, FORK -1 pthread_create(&t300, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L761] 0 z$w_buff1 = z$w_buff0 [L762] 0 z$w_buff0 = 1 [L763] 0 z$w_buff1_used = z$w_buff0_used [L764] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L766] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L767] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L768] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L769] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L770] 0 z$r_buff0_thd3 = (_Bool)1 [L773] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L774] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L775] 0 z$flush_delayed = weak$$choice2 [L776] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L777] 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_p1_EAX=0, __unbuffered_p1_EBX=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] [L777] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L777] 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_p1_EAX=0, __unbuffered_p1_EBX=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] [L777] 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) [L778] 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_p1_EAX=0, __unbuffered_p1_EBX=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] [L778] 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)) [L779] 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_p1_EAX=0, __unbuffered_p1_EBX=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] [L779] 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)) [L780] 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_p1_EAX=0, __unbuffered_p1_EBX=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_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)) [L781] 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_p1_EAX=0, __unbuffered_p1_EBX=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_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)) [L782] 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_p1_EAX=0, __unbuffered_p1_EBX=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$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)) [L783] 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_p1_EAX=0, __unbuffered_p1_EBX=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$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)) [L784] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L785] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L785] 0 z = z$flush_delayed ? z$mem_tmp : z [L786] 0 z$flush_delayed = (_Bool)0 [L789] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L792] 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_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] 1 a = 1 [L715] 1 x = 1 [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L727] 2 x = 2 [L730] 2 y = 1 [L733] 2 __unbuffered_p1_EAX = y [L736] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L737] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L738] 2 z$flush_delayed = weak$$choice2 [L739] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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] [L740] 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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] [L792] 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) [L793] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, y=1, 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] [L793] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L794] 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 [!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_p1_EAX=1, __unbuffered_p1_EBX=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=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 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) [L741] 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 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)) [L742] 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 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)) [L743] 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_p1_EAX=1, __unbuffered_p1_EBX=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))=0, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 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)) [L744] 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 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 [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L796] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 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 [L799] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 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)) [L745] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 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)) [L746] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 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)) [L747] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L748] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z = z$flush_delayed ? z$mem_tmp : z [L749] 2 z$flush_delayed = (_Bool)0 [L754] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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] [L821] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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] [L825] 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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] [L825] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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] [L825] 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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] [L825] -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) [L826] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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] [L826] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L827] 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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$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 [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L829] 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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$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 [L832] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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, 304 locations, 3 error locations. UNSAFE Result, 248.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 28.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8624 SDtfs, 10068 SDslu, 22628 SDs, 0 SdLazy, 7406 SolverSat, 428 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 64 SyntacticMatches, 22 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445146occurred 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: 63.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 469658 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2350 NumberOfCodeBlocks, 2350 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 494789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...