./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/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 3d287fce75dc873494b995778754ff1185af89eb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:39:04,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:39:04,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:39:04,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:39:04,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:39:04,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:39:04,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:39:04,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:39:04,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:39:04,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:39:04,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:39:04,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:39:04,661 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:39:04,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:39:04,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:39:04,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:39:04,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:39:04,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:39:04,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:39:04,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:39:04,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:39:04,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:39:04,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:39:04,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:39:04,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:39:04,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:39:04,668 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:39:04,669 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:39:04,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:39:04,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:39:04,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:39:04,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:39:04,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:39:04,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:39:04,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:39:04,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:39:04,671 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 10:39:04,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:39:04,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:39:04,679 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 10:39:04,679 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 10:39:04,679 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:39:04,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 10:39:04,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 10:39:04,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 10:39:04,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 10:39:04,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 10:39:04,682 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:39:04,682 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 10:39:04,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 10:39:04,682 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_d62c8a05-759f-4711-93e5-44d846d335aa/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 -> 3d287fce75dc873494b995778754ff1185af89eb [2018-12-08 10:39:04,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:39:04,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:39:04,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:39:04,709 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:39:04,709 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:39:04,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i [2018-12-08 10:39:04,744 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/data/4fc4ff86a/156d7bc8b353412d8cb9c56cb67faa4c/FLAG439a5d311 [2018-12-08 10:39:05,119 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:39:05,120 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/sv-benchmarks/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i [2018-12-08 10:39:05,128 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/data/4fc4ff86a/156d7bc8b353412d8cb9c56cb67faa4c/FLAG439a5d311 [2018-12-08 10:39:05,474 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/data/4fc4ff86a/156d7bc8b353412d8cb9c56cb67faa4c [2018-12-08 10:39:05,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:39:05,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:39:05,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:39:05,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:39:05,480 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:39:05,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05, skipping insertion in model container [2018-12-08 10:39:05,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:39:05,508 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:39:05,682 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:39:05,690 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:39:05,761 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:39:05,792 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:39:05,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05 WrapperNode [2018-12-08 10:39:05,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:39:05,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:39:05,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:39:05,793 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:39:05,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:39:05,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:39:05,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:39:05,824 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:39:05,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... [2018-12-08 10:39:05,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:39:05,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:39:05,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:39:05,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:39:05,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/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 10:39:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:39:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:39:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 10:39:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:39:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 10:39:05,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 10:39:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 10:39:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 10:39:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 10:39:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:39:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:39:05,878 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 10:39:06,193 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:39:06,194 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 10:39:06,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:39:06 BoogieIcfgContainer [2018-12-08 10:39:06,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:39:06,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 10:39:06,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 10:39:06,197 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 10:39:06,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:39:05" (1/3) ... [2018-12-08 10:39:06,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99dcce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:39:06, skipping insertion in model container [2018-12-08 10:39:06,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:39:05" (2/3) ... [2018-12-08 10:39:06,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99dcce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:39:06, skipping insertion in model container [2018-12-08 10:39:06,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:39:06" (3/3) ... [2018-12-08 10:39:06,199 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc_false-unreach-call.i [2018-12-08 10:39:06,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,222 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,222 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,222 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,223 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,223 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,229 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,229 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:39:06,254 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 10:39:06,254 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 10:39:06,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 10:39:06,270 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 10:39:06,284 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:39:06,285 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 10:39:06,285 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 10:39:06,285 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 10:39:06,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:39:06,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:39:06,285 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 10:39:06,285 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:39:06,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 10:39:06,292 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-12-08 10:39:07,732 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-12-08 10:39:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-12-08 10:39:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 10:39:07,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:07,739 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] [2018-12-08 10:39:07,741 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:07,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-12-08 10:39:07,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:07,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:07,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:07,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:07,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:07,878 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 10:39:07,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:07,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:39:07,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:39:07,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:39:07,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:39:07,893 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-12-08 10:39:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:08,404 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-12-08 10:39:08,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:39:08,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-08 10:39:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:08,578 INFO L225 Difference]: With dead ends: 60793 [2018-12-08 10:39:08,578 INFO L226 Difference]: Without dead ends: 44273 [2018-12-08 10:39:08,579 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 10:39:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-12-08 10:39:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-12-08 10:39:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-12-08 10:39:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-12-08 10:39:09,313 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-12-08 10:39:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:09,314 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-12-08 10:39:09,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:39:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-12-08 10:39:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 10:39:09,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:09,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:39:09,318 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:09,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:09,318 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-12-08 10:39:09,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:09,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:09,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:09,364 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 10:39:09,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:09,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:39:09,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:39:09,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:39:09,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:39:09,366 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 4 states. [2018-12-08 10:39:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:09,427 INFO L93 Difference]: Finished difference Result 8531 states and 28347 transitions. [2018-12-08 10:39:09,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:39:09,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-08 10:39:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:09,440 INFO L225 Difference]: With dead ends: 8531 [2018-12-08 10:39:09,440 INFO L226 Difference]: Without dead ends: 7469 [2018-12-08 10:39:09,441 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 10:39:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-12-08 10:39:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 7469. [2018-12-08 10:39:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-12-08 10:39:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 24639 transitions. [2018-12-08 10:39:09,527 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 24639 transitions. Word has length 48 [2018-12-08 10:39:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:09,527 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 24639 transitions. [2018-12-08 10:39:09,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:39:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 24639 transitions. [2018-12-08 10:39:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 10:39:09,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:09,528 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] [2018-12-08 10:39:09,528 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:09,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-12-08 10:39:09,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:09,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:09,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:09,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:09,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:09,569 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 10:39:09,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:09,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:39:09,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:39:09,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:39:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:39:09,570 INFO L87 Difference]: Start difference. First operand 7469 states and 24639 transitions. Second operand 5 states. [2018-12-08 10:39:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:09,777 INFO L93 Difference]: Finished difference Result 14001 states and 45808 transitions. [2018-12-08 10:39:09,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:39:09,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-08 10:39:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:09,794 INFO L225 Difference]: With dead ends: 14001 [2018-12-08 10:39:09,794 INFO L226 Difference]: Without dead ends: 13933 [2018-12-08 10:39:09,794 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 10:39:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2018-12-08 10:39:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 9444. [2018-12-08 10:39:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2018-12-08 10:39:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 30545 transitions. [2018-12-08 10:39:09,925 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 30545 transitions. Word has length 49 [2018-12-08 10:39:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:09,926 INFO L480 AbstractCegarLoop]: Abstraction has 9444 states and 30545 transitions. [2018-12-08 10:39:09,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:39:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 30545 transitions. [2018-12-08 10:39:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 10:39:09,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:09,927 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] [2018-12-08 10:39:09,927 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:09,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:09,927 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-12-08 10:39:09,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:09,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:09,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:39:09,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:09,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:39:09,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:39:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:39:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:39:09,961 INFO L87 Difference]: Start difference. First operand 9444 states and 30545 transitions. Second operand 3 states. [2018-12-08 10:39:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:10,077 INFO L93 Difference]: Finished difference Result 13282 states and 42644 transitions. [2018-12-08 10:39:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:39:10,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-08 10:39:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:10,092 INFO L225 Difference]: With dead ends: 13282 [2018-12-08 10:39:10,092 INFO L226 Difference]: Without dead ends: 13282 [2018-12-08 10:39:10,092 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 10:39:10,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13282 states. [2018-12-08 10:39:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13282 to 9848. [2018-12-08 10:39:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9848 states. [2018-12-08 10:39:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 31511 transitions. [2018-12-08 10:39:10,209 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 31511 transitions. Word has length 51 [2018-12-08 10:39:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:10,210 INFO L480 AbstractCegarLoop]: Abstraction has 9848 states and 31511 transitions. [2018-12-08 10:39:10,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:39:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 31511 transitions. [2018-12-08 10:39:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 10:39:10,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:10,211 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 10:39:10,212 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:10,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-12-08 10:39:10,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:10,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:39:10,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:10,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:39:10,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:39:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:39:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:39:10,252 INFO L87 Difference]: Start difference. First operand 9848 states and 31511 transitions. Second operand 6 states. [2018-12-08 10:39:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:10,499 INFO L93 Difference]: Finished difference Result 14206 states and 45067 transitions. [2018-12-08 10:39:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:39:10,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-08 10:39:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:10,515 INFO L225 Difference]: With dead ends: 14206 [2018-12-08 10:39:10,515 INFO L226 Difference]: Without dead ends: 14134 [2018-12-08 10:39:10,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:39:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14134 states. [2018-12-08 10:39:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14134 to 10852. [2018-12-08 10:39:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10852 states. [2018-12-08 10:39:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10852 states to 10852 states and 34566 transitions. [2018-12-08 10:39:10,638 INFO L78 Accepts]: Start accepts. Automaton has 10852 states and 34566 transitions. Word has length 55 [2018-12-08 10:39:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:10,638 INFO L480 AbstractCegarLoop]: Abstraction has 10852 states and 34566 transitions. [2018-12-08 10:39:10,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:39:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 10852 states and 34566 transitions. [2018-12-08 10:39:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 10:39:10,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:10,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:39:10,641 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:10,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-12-08 10:39:10,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:10,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:10,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:10,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:10,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:39:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:10,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:39:10,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:39:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:39:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:39:10,693 INFO L87 Difference]: Start difference. First operand 10852 states and 34566 transitions. Second operand 4 states. [2018-12-08 10:39:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:10,774 INFO L93 Difference]: Finished difference Result 12399 states and 39575 transitions. [2018-12-08 10:39:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:39:10,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 10:39:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:10,788 INFO L225 Difference]: With dead ends: 12399 [2018-12-08 10:39:10,788 INFO L226 Difference]: Without dead ends: 12399 [2018-12-08 10:39:10,789 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 10:39:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2018-12-08 10:39:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 11372. [2018-12-08 10:39:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11372 states. [2018-12-08 10:39:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 36239 transitions. [2018-12-08 10:39:10,906 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 36239 transitions. Word has length 63 [2018-12-08 10:39:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:10,906 INFO L480 AbstractCegarLoop]: Abstraction has 11372 states and 36239 transitions. [2018-12-08 10:39:10,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:39:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 36239 transitions. [2018-12-08 10:39:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 10:39:10,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:10,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:39:10,910 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:10,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-12-08 10:39:10,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:10,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:10,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:10,946 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 10:39:10,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:10,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:39:10,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:39:10,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:39:10,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:39:10,948 INFO L87 Difference]: Start difference. First operand 11372 states and 36239 transitions. Second operand 6 states. [2018-12-08 10:39:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:11,259 INFO L93 Difference]: Finished difference Result 20972 states and 66489 transitions. [2018-12-08 10:39:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:39:11,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-08 10:39:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:11,286 INFO L225 Difference]: With dead ends: 20972 [2018-12-08 10:39:11,286 INFO L226 Difference]: Without dead ends: 20901 [2018-12-08 10:39:11,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:39:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2018-12-08 10:39:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 13758. [2018-12-08 10:39:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13758 states. [2018-12-08 10:39:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13758 states to 13758 states and 43283 transitions. [2018-12-08 10:39:11,540 INFO L78 Accepts]: Start accepts. Automaton has 13758 states and 43283 transitions. Word has length 63 [2018-12-08 10:39:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:11,540 INFO L480 AbstractCegarLoop]: Abstraction has 13758 states and 43283 transitions. [2018-12-08 10:39:11,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:39:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13758 states and 43283 transitions. [2018-12-08 10:39:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 10:39:11,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:11,544 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] [2018-12-08 10:39:11,544 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:11,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash 81708496, now seen corresponding path program 1 times [2018-12-08 10:39:11,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:11,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:11,580 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 10:39:11,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:11,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:39:11,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:39:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:39:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:39:11,581 INFO L87 Difference]: Start difference. First operand 13758 states and 43283 transitions. Second operand 4 states. [2018-12-08 10:39:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:11,790 INFO L93 Difference]: Finished difference Result 19950 states and 63167 transitions. [2018-12-08 10:39:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:39:11,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-08 10:39:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:11,813 INFO L225 Difference]: With dead ends: 19950 [2018-12-08 10:39:11,813 INFO L226 Difference]: Without dead ends: 19950 [2018-12-08 10:39:11,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:39:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2018-12-08 10:39:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 17922. [2018-12-08 10:39:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2018-12-08 10:39:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 57082 transitions. [2018-12-08 10:39:12,013 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 57082 transitions. Word has length 67 [2018-12-08 10:39:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:12,013 INFO L480 AbstractCegarLoop]: Abstraction has 17922 states and 57082 transitions. [2018-12-08 10:39:12,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:39:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 57082 transitions. [2018-12-08 10:39:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 10:39:12,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:12,017 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] [2018-12-08 10:39:12,017 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:12,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1725745967, now seen corresponding path program 1 times [2018-12-08 10:39:12,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:12,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:12,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:12,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:12,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 10:39:12,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:12,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:39:12,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:39:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:39:12,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:39:12,067 INFO L87 Difference]: Start difference. First operand 17922 states and 57082 transitions. Second operand 4 states. [2018-12-08 10:39:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:12,295 INFO L93 Difference]: Finished difference Result 22122 states and 69359 transitions. [2018-12-08 10:39:12,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:39:12,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-08 10:39:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:12,321 INFO L225 Difference]: With dead ends: 22122 [2018-12-08 10:39:12,321 INFO L226 Difference]: Without dead ends: 22122 [2018-12-08 10:39:12,322 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 10:39:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2018-12-08 10:39:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 20008. [2018-12-08 10:39:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-12-08 10:39:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 63081 transitions. [2018-12-08 10:39:12,536 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 63081 transitions. Word has length 67 [2018-12-08 10:39:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:12,536 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 63081 transitions. [2018-12-08 10:39:12,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:39:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 63081 transitions. [2018-12-08 10:39:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 10:39:12,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:12,542 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] [2018-12-08 10:39:12,542 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:12,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 492011986, now seen corresponding path program 1 times [2018-12-08 10:39:12,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:12,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:12,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:12,564 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 10:39:12,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:12,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:39:12,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:39:12,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:39:12,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:39:12,565 INFO L87 Difference]: Start difference. First operand 20008 states and 63081 transitions. Second operand 3 states. [2018-12-08 10:39:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:12,779 INFO L93 Difference]: Finished difference Result 20728 states and 65064 transitions. [2018-12-08 10:39:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:39:12,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-08 10:39:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:12,800 INFO L225 Difference]: With dead ends: 20728 [2018-12-08 10:39:12,800 INFO L226 Difference]: Without dead ends: 20728 [2018-12-08 10:39:12,800 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 10:39:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20728 states. [2018-12-08 10:39:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20728 to 20404. [2018-12-08 10:39:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20404 states. [2018-12-08 10:39:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20404 states to 20404 states and 64159 transitions. [2018-12-08 10:39:12,996 INFO L78 Accepts]: Start accepts. Automaton has 20404 states and 64159 transitions. Word has length 67 [2018-12-08 10:39:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:12,996 INFO L480 AbstractCegarLoop]: Abstraction has 20404 states and 64159 transitions. [2018-12-08 10:39:12,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:39:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 20404 states and 64159 transitions. [2018-12-08 10:39:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:39:13,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:13,003 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] [2018-12-08 10:39:13,003 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:13,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2096525335, now seen corresponding path program 1 times [2018-12-08 10:39:13,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:13,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:13,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:13,033 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 10:39:13,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:13,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:39:13,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:39:13,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:39:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:39:13,034 INFO L87 Difference]: Start difference. First operand 20404 states and 64159 transitions. Second operand 3 states. [2018-12-08 10:39:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:13,163 INFO L93 Difference]: Finished difference Result 25692 states and 80601 transitions. [2018-12-08 10:39:13,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:39:13,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 10:39:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:13,194 INFO L225 Difference]: With dead ends: 25692 [2018-12-08 10:39:13,194 INFO L226 Difference]: Without dead ends: 25692 [2018-12-08 10:39:13,195 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 10:39:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25692 states. [2018-12-08 10:39:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25692 to 24788. [2018-12-08 10:39:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24788 states. [2018-12-08 10:39:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24788 states to 24788 states and 77827 transitions. [2018-12-08 10:39:13,462 INFO L78 Accepts]: Start accepts. Automaton has 24788 states and 77827 transitions. Word has length 69 [2018-12-08 10:39:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:13,462 INFO L480 AbstractCegarLoop]: Abstraction has 24788 states and 77827 transitions. [2018-12-08 10:39:13,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:39:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 24788 states and 77827 transitions. [2018-12-08 10:39:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:39:13,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:13,470 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] [2018-12-08 10:39:13,470 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:13,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash -401490602, now seen corresponding path program 1 times [2018-12-08 10:39:13,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:13,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:13,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:13,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:13,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:13,519 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 10:39:13,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:13,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:39:13,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:39:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:39:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:39:13,520 INFO L87 Difference]: Start difference. First operand 24788 states and 77827 transitions. Second operand 6 states. [2018-12-08 10:39:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:14,068 INFO L93 Difference]: Finished difference Result 29944 states and 92734 transitions. [2018-12-08 10:39:14,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:39:14,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-08 10:39:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:14,103 INFO L225 Difference]: With dead ends: 29944 [2018-12-08 10:39:14,103 INFO L226 Difference]: Without dead ends: 29944 [2018-12-08 10:39:14,103 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 10:39:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29944 states. [2018-12-08 10:39:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29944 to 28268. [2018-12-08 10:39:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28268 states. [2018-12-08 10:39:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28268 states to 28268 states and 88152 transitions. [2018-12-08 10:39:14,422 INFO L78 Accepts]: Start accepts. Automaton has 28268 states and 88152 transitions. Word has length 69 [2018-12-08 10:39:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:14,422 INFO L480 AbstractCegarLoop]: Abstraction has 28268 states and 88152 transitions. [2018-12-08 10:39:14,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:39:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 28268 states and 88152 transitions. [2018-12-08 10:39:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:39:14,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:14,433 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] [2018-12-08 10:39:14,433 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:14,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1816267351, now seen corresponding path program 1 times [2018-12-08 10:39:14,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:14,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:14,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:14,498 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 10:39:14,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:14,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:39:14,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:39:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:39:14,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:39:14,499 INFO L87 Difference]: Start difference. First operand 28268 states and 88152 transitions. Second operand 6 states. [2018-12-08 10:39:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:14,833 INFO L93 Difference]: Finished difference Result 32012 states and 96857 transitions. [2018-12-08 10:39:14,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 10:39:14,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-08 10:39:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:14,874 INFO L225 Difference]: With dead ends: 32012 [2018-12-08 10:39:14,874 INFO L226 Difference]: Without dead ends: 32012 [2018-12-08 10:39:14,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:39:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32012 states. [2018-12-08 10:39:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32012 to 28944. [2018-12-08 10:39:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28944 states. [2018-12-08 10:39:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28944 states to 28944 states and 88943 transitions. [2018-12-08 10:39:15,249 INFO L78 Accepts]: Start accepts. Automaton has 28944 states and 88943 transitions. Word has length 69 [2018-12-08 10:39:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:15,250 INFO L480 AbstractCegarLoop]: Abstraction has 28944 states and 88943 transitions. [2018-12-08 10:39:15,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:39:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 28944 states and 88943 transitions. [2018-12-08 10:39:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:39:15,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:15,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:39:15,259 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:15,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:15,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2027618264, now seen corresponding path program 1 times [2018-12-08 10:39:15,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:15,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:15,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:15,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:15,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:15,308 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 10:39:15,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:15,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:39:15,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:39:15,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:39:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:39:15,309 INFO L87 Difference]: Start difference. First operand 28944 states and 88943 transitions. Second operand 5 states. [2018-12-08 10:39:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:15,571 INFO L93 Difference]: Finished difference Result 35071 states and 107222 transitions. [2018-12-08 10:39:15,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:39:15,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-08 10:39:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:15,612 INFO L225 Difference]: With dead ends: 35071 [2018-12-08 10:39:15,612 INFO L226 Difference]: Without dead ends: 35071 [2018-12-08 10:39:15,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 10:39:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35071 states. [2018-12-08 10:39:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35071 to 31628. [2018-12-08 10:39:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31628 states. [2018-12-08 10:39:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 96602 transitions. [2018-12-08 10:39:15,959 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 96602 transitions. Word has length 69 [2018-12-08 10:39:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:15,959 INFO L480 AbstractCegarLoop]: Abstraction has 31628 states and 96602 transitions. [2018-12-08 10:39:15,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:39:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 96602 transitions. [2018-12-08 10:39:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:39:15,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:15,968 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] [2018-12-08 10:39:15,968 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:15,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash -279867272, now seen corresponding path program 1 times [2018-12-08 10:39:15,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:15,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:15,985 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 10:39:15,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:15,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:39:15,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:39:15,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:39:15,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:39:15,986 INFO L87 Difference]: Start difference. First operand 31628 states and 96602 transitions. Second operand 3 states. [2018-12-08 10:39:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:16,163 INFO L93 Difference]: Finished difference Result 42528 states and 128529 transitions. [2018-12-08 10:39:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:39:16,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 10:39:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:16,213 INFO L225 Difference]: With dead ends: 42528 [2018-12-08 10:39:16,213 INFO L226 Difference]: Without dead ends: 42528 [2018-12-08 10:39:16,213 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 10:39:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2018-12-08 10:39:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 32736. [2018-12-08 10:39:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32736 states. [2018-12-08 10:39:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32736 states to 32736 states and 99897 transitions. [2018-12-08 10:39:16,607 INFO L78 Accepts]: Start accepts. Automaton has 32736 states and 99897 transitions. Word has length 69 [2018-12-08 10:39:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:16,607 INFO L480 AbstractCegarLoop]: Abstraction has 32736 states and 99897 transitions. [2018-12-08 10:39:16,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:39:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32736 states and 99897 transitions. [2018-12-08 10:39:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:39:16,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:16,615 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] [2018-12-08 10:39:16,615 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:16,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2018-12-08 10:39:16,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:16,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:16,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:39:16,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:16,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:39:16,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:39:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:39:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:39:16,752 INFO L87 Difference]: Start difference. First operand 32736 states and 99897 transitions. Second operand 7 states. [2018-12-08 10:39:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:17,084 INFO L93 Difference]: Finished difference Result 29386 states and 84354 transitions. [2018-12-08 10:39:17,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:39:17,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-08 10:39:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:17,113 INFO L225 Difference]: With dead ends: 29386 [2018-12-08 10:39:17,113 INFO L226 Difference]: Without dead ends: 29386 [2018-12-08 10:39:17,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:39:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29386 states. [2018-12-08 10:39:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29386 to 24927. [2018-12-08 10:39:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24927 states. [2018-12-08 10:39:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24927 states to 24927 states and 71599 transitions. [2018-12-08 10:39:17,380 INFO L78 Accepts]: Start accepts. Automaton has 24927 states and 71599 transitions. Word has length 69 [2018-12-08 10:39:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:17,380 INFO L480 AbstractCegarLoop]: Abstraction has 24927 states and 71599 transitions. [2018-12-08 10:39:17,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:39:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24927 states and 71599 transitions. [2018-12-08 10:39:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:39:17,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:17,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:39:17,387 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:17,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:17,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1199818054, now seen corresponding path program 1 times [2018-12-08 10:39:17,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:17,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:17,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:17,420 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 10:39:17,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:17,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:39:17,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:39:17,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:39:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:39:17,421 INFO L87 Difference]: Start difference. First operand 24927 states and 71599 transitions. Second operand 5 states. [2018-12-08 10:39:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:17,459 INFO L93 Difference]: Finished difference Result 7463 states and 17981 transitions. [2018-12-08 10:39:17,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:39:17,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-08 10:39:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:17,464 INFO L225 Difference]: With dead ends: 7463 [2018-12-08 10:39:17,464 INFO L226 Difference]: Without dead ends: 6138 [2018-12-08 10:39:17,464 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 10:39:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2018-12-08 10:39:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5532. [2018-12-08 10:39:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2018-12-08 10:39:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 12870 transitions. [2018-12-08 10:39:17,502 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 12870 transitions. Word has length 69 [2018-12-08 10:39:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:17,503 INFO L480 AbstractCegarLoop]: Abstraction has 5532 states and 12870 transitions. [2018-12-08 10:39:17,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:39:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 12870 transitions. [2018-12-08 10:39:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:39:17,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:17,505 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] [2018-12-08 10:39:17,506 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:17,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:17,506 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-12-08 10:39:17,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:17,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:17,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:17,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:17,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:17,518 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 10:39:17,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:17,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:39:17,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:39:17,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:39:17,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:39:17,519 INFO L87 Difference]: Start difference. First operand 5532 states and 12870 transitions. Second operand 3 states. [2018-12-08 10:39:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:17,544 INFO L93 Difference]: Finished difference Result 7168 states and 16476 transitions. [2018-12-08 10:39:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:39:17,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 10:39:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:17,548 INFO L225 Difference]: With dead ends: 7168 [2018-12-08 10:39:17,549 INFO L226 Difference]: Without dead ends: 7168 [2018-12-08 10:39:17,549 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 10:39:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2018-12-08 10:39:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5471. [2018-12-08 10:39:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2018-12-08 10:39:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12410 transitions. [2018-12-08 10:39:17,588 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12410 transitions. Word has length 69 [2018-12-08 10:39:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:17,589 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12410 transitions. [2018-12-08 10:39:17,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:39:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12410 transitions. [2018-12-08 10:39:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 10:39:17,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:17,592 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] [2018-12-08 10:39:17,592 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:17,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:17,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-12-08 10:39:17,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:17,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:17,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:17,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:17,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:17,626 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 10:39:17,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:17,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:39:17,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:39:17,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:39:17,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:39:17,627 INFO L87 Difference]: Start difference. First operand 5471 states and 12410 transitions. Second operand 5 states. [2018-12-08 10:39:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:17,723 INFO L93 Difference]: Finished difference Result 6625 states and 15015 transitions. [2018-12-08 10:39:17,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 10:39:17,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-08 10:39:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:17,727 INFO L225 Difference]: With dead ends: 6625 [2018-12-08 10:39:17,727 INFO L226 Difference]: Without dead ends: 6625 [2018-12-08 10:39:17,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:39:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2018-12-08 10:39:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 5915. [2018-12-08 10:39:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2018-12-08 10:39:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13414 transitions. [2018-12-08 10:39:17,767 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13414 transitions. Word has length 75 [2018-12-08 10:39:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:17,767 INFO L480 AbstractCegarLoop]: Abstraction has 5915 states and 13414 transitions. [2018-12-08 10:39:17,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:39:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13414 transitions. [2018-12-08 10:39:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 10:39:17,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:17,771 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] [2018-12-08 10:39:17,771 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:17,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-12-08 10:39:17,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:17,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:17,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:17,816 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 10:39:17,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:17,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:39:17,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:39:17,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:39:17,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:39:17,817 INFO L87 Difference]: Start difference. First operand 5915 states and 13414 transitions. Second operand 7 states. [2018-12-08 10:39:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:18,032 INFO L93 Difference]: Finished difference Result 6842 states and 15342 transitions. [2018-12-08 10:39:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 10:39:18,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-08 10:39:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:18,037 INFO L225 Difference]: With dead ends: 6842 [2018-12-08 10:39:18,037 INFO L226 Difference]: Without dead ends: 6740 [2018-12-08 10:39:18,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-08 10:39:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2018-12-08 10:39:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6012. [2018-12-08 10:39:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6012 states. [2018-12-08 10:39:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 13507 transitions. [2018-12-08 10:39:18,079 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 13507 transitions. Word has length 75 [2018-12-08 10:39:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:18,079 INFO L480 AbstractCegarLoop]: Abstraction has 6012 states and 13507 transitions. [2018-12-08 10:39:18,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:39:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 13507 transitions. [2018-12-08 10:39:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 10:39:18,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:18,083 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] [2018-12-08 10:39:18,083 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:18,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash 189178790, now seen corresponding path program 1 times [2018-12-08 10:39:18,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:18,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:18,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:18,129 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 10:39:18,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:18,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:39:18,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:39:18,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:39:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:39:18,130 INFO L87 Difference]: Start difference. First operand 6012 states and 13507 transitions. Second operand 7 states. [2018-12-08 10:39:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:18,444 INFO L93 Difference]: Finished difference Result 7492 states and 16836 transitions. [2018-12-08 10:39:18,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:39:18,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 10:39:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:18,449 INFO L225 Difference]: With dead ends: 7492 [2018-12-08 10:39:18,449 INFO L226 Difference]: Without dead ends: 7492 [2018-12-08 10:39:18,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:39:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2018-12-08 10:39:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 6152. [2018-12-08 10:39:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2018-12-08 10:39:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13895 transitions. [2018-12-08 10:39:18,498 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13895 transitions. Word has length 96 [2018-12-08 10:39:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:18,498 INFO L480 AbstractCegarLoop]: Abstraction has 6152 states and 13895 transitions. [2018-12-08 10:39:18,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:39:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13895 transitions. [2018-12-08 10:39:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 10:39:18,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:18,502 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] [2018-12-08 10:39:18,502 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:18,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:18,502 INFO L82 PathProgramCache]: Analyzing trace with hash -466870943, now seen corresponding path program 1 times [2018-12-08 10:39:18,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:18,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:18,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:18,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:18,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:18,526 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 10:39:18,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:18,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:39:18,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:39:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:39:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:39:18,527 INFO L87 Difference]: Start difference. First operand 6152 states and 13895 transitions. Second operand 4 states. [2018-12-08 10:39:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:18,584 INFO L93 Difference]: Finished difference Result 7319 states and 16393 transitions. [2018-12-08 10:39:18,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:39:18,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-08 10:39:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:18,588 INFO L225 Difference]: With dead ends: 7319 [2018-12-08 10:39:18,589 INFO L226 Difference]: Without dead ends: 7319 [2018-12-08 10:39:18,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:39:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2018-12-08 10:39:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6509. [2018-12-08 10:39:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2018-12-08 10:39:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 14665 transitions. [2018-12-08 10:39:18,639 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 14665 transitions. Word has length 96 [2018-12-08 10:39:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:18,639 INFO L480 AbstractCegarLoop]: Abstraction has 6509 states and 14665 transitions. [2018-12-08 10:39:18,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:39:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 14665 transitions. [2018-12-08 10:39:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:18,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:18,643 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] [2018-12-08 10:39:18,643 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:18,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1444042279, now seen corresponding path program 1 times [2018-12-08 10:39:18,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:18,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:18,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:18,678 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 10:39:18,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:18,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:39:18,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:39:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:39:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:39:18,679 INFO L87 Difference]: Start difference. First operand 6509 states and 14665 transitions. Second operand 5 states. [2018-12-08 10:39:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:18,747 INFO L93 Difference]: Finished difference Result 7016 states and 15753 transitions. [2018-12-08 10:39:18,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:39:18,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-08 10:39:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:18,752 INFO L225 Difference]: With dead ends: 7016 [2018-12-08 10:39:18,752 INFO L226 Difference]: Without dead ends: 7016 [2018-12-08 10:39:18,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:39:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2018-12-08 10:39:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 5405. [2018-12-08 10:39:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2018-12-08 10:39:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 12181 transitions. [2018-12-08 10:39:18,794 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 12181 transitions. Word has length 98 [2018-12-08 10:39:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:18,794 INFO L480 AbstractCegarLoop]: Abstraction has 5405 states and 12181 transitions. [2018-12-08 10:39:18,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:39:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 12181 transitions. [2018-12-08 10:39:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:18,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:18,799 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] [2018-12-08 10:39:18,799 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:18,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:18,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1455358406, now seen corresponding path program 1 times [2018-12-08 10:39:18,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:18,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:18,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:18,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:18,860 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 10:39:18,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:18,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:39:18,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:39:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:39:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:39:18,861 INFO L87 Difference]: Start difference. First operand 5405 states and 12181 transitions. Second operand 4 states. [2018-12-08 10:39:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:18,996 INFO L93 Difference]: Finished difference Result 6953 states and 15553 transitions. [2018-12-08 10:39:18,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:39:18,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-08 10:39:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:19,001 INFO L225 Difference]: With dead ends: 6953 [2018-12-08 10:39:19,001 INFO L226 Difference]: Without dead ends: 6886 [2018-12-08 10:39:19,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:39:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2018-12-08 10:39:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6454. [2018-12-08 10:39:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6454 states. [2018-12-08 10:39:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 14500 transitions. [2018-12-08 10:39:19,051 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 14500 transitions. Word has length 98 [2018-12-08 10:39:19,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:19,051 INFO L480 AbstractCegarLoop]: Abstraction has 6454 states and 14500 transitions. [2018-12-08 10:39:19,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:39:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 14500 transitions. [2018-12-08 10:39:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:19,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:19,055 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] [2018-12-08 10:39:19,055 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:19,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:19,056 INFO L82 PathProgramCache]: Analyzing trace with hash -621850937, now seen corresponding path program 1 times [2018-12-08 10:39:19,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:19,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:19,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:19,155 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 10:39:19,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:19,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 10:39:19,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 10:39:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:39:19,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:39:19,156 INFO L87 Difference]: Start difference. First operand 6454 states and 14500 transitions. Second operand 9 states. [2018-12-08 10:39:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:19,798 INFO L93 Difference]: Finished difference Result 8235 states and 18257 transitions. [2018-12-08 10:39:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 10:39:19,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-08 10:39:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:19,804 INFO L225 Difference]: With dead ends: 8235 [2018-12-08 10:39:19,804 INFO L226 Difference]: Without dead ends: 8235 [2018-12-08 10:39:19,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-08 10:39:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8235 states. [2018-12-08 10:39:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8235 to 7030. [2018-12-08 10:39:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7030 states. [2018-12-08 10:39:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 15670 transitions. [2018-12-08 10:39:19,858 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 15670 transitions. Word has length 98 [2018-12-08 10:39:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:19,858 INFO L480 AbstractCegarLoop]: Abstraction has 7030 states and 15670 transitions. [2018-12-08 10:39:19,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 10:39:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 15670 transitions. [2018-12-08 10:39:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:19,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:19,862 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] [2018-12-08 10:39:19,862 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:19,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash -410500024, now seen corresponding path program 1 times [2018-12-08 10:39:19,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:19,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:19,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:19,953 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 10:39:19,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:19,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 10:39:19,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 10:39:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:39:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:39:19,954 INFO L87 Difference]: Start difference. First operand 7030 states and 15670 transitions. Second operand 9 states. [2018-12-08 10:39:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:20,260 INFO L93 Difference]: Finished difference Result 8246 states and 18329 transitions. [2018-12-08 10:39:20,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 10:39:20,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-08 10:39:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:20,266 INFO L225 Difference]: With dead ends: 8246 [2018-12-08 10:39:20,266 INFO L226 Difference]: Without dead ends: 8159 [2018-12-08 10:39:20,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-08 10:39:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8159 states. [2018-12-08 10:39:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8159 to 6991. [2018-12-08 10:39:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6991 states. [2018-12-08 10:39:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6991 states to 6991 states and 15582 transitions. [2018-12-08 10:39:20,341 INFO L78 Accepts]: Start accepts. Automaton has 6991 states and 15582 transitions. Word has length 98 [2018-12-08 10:39:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:20,341 INFO L480 AbstractCegarLoop]: Abstraction has 6991 states and 15582 transitions. [2018-12-08 10:39:20,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 10:39:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 6991 states and 15582 transitions. [2018-12-08 10:39:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:20,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:20,347 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] [2018-12-08 10:39:20,347 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:20,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash 477003657, now seen corresponding path program 1 times [2018-12-08 10:39:20,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:20,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:20,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:39:20,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:20,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 10:39:20,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 10:39:20,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:39:20,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:39:20,472 INFO L87 Difference]: Start difference. First operand 6991 states and 15582 transitions. Second operand 9 states. [2018-12-08 10:39:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:20,930 INFO L93 Difference]: Finished difference Result 11197 states and 24928 transitions. [2018-12-08 10:39:20,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:39:20,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-08 10:39:20,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:20,935 INFO L225 Difference]: With dead ends: 11197 [2018-12-08 10:39:20,935 INFO L226 Difference]: Without dead ends: 8089 [2018-12-08 10:39:20,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-08 10:39:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2018-12-08 10:39:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 7048. [2018-12-08 10:39:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2018-12-08 10:39:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 15699 transitions. [2018-12-08 10:39:20,991 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 15699 transitions. Word has length 98 [2018-12-08 10:39:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:20,991 INFO L480 AbstractCegarLoop]: Abstraction has 7048 states and 15699 transitions. [2018-12-08 10:39:20,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 10:39:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 15699 transitions. [2018-12-08 10:39:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:20,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:20,996 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] [2018-12-08 10:39:20,996 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:20,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash -543309766, now seen corresponding path program 1 times [2018-12-08 10:39:20,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:21,051 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 10:39:21,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:21,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:39:21,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:39:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:39:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:39:21,052 INFO L87 Difference]: Start difference. First operand 7048 states and 15699 transitions. Second operand 6 states. [2018-12-08 10:39:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:21,184 INFO L93 Difference]: Finished difference Result 7978 states and 17540 transitions. [2018-12-08 10:39:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:39:21,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-08 10:39:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:21,189 INFO L225 Difference]: With dead ends: 7978 [2018-12-08 10:39:21,189 INFO L226 Difference]: Without dead ends: 7926 [2018-12-08 10:39:21,190 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 10:39:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7926 states. [2018-12-08 10:39:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7926 to 6952. [2018-12-08 10:39:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6952 states. [2018-12-08 10:39:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 15372 transitions. [2018-12-08 10:39:21,241 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 15372 transitions. Word has length 98 [2018-12-08 10:39:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:21,241 INFO L480 AbstractCegarLoop]: Abstraction has 6952 states and 15372 transitions. [2018-12-08 10:39:21,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:39:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 15372 transitions. [2018-12-08 10:39:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:21,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:21,246 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] [2018-12-08 10:39:21,246 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:21,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1661772762, now seen corresponding path program 2 times [2018-12-08 10:39:21,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:21,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:21,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:21,303 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 10:39:21,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:21,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:39:21,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:39:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:39:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:39:21,303 INFO L87 Difference]: Start difference. First operand 6952 states and 15372 transitions. Second operand 6 states. [2018-12-08 10:39:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:21,421 INFO L93 Difference]: Finished difference Result 7313 states and 16120 transitions. [2018-12-08 10:39:21,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:39:21,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-08 10:39:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:21,428 INFO L225 Difference]: With dead ends: 7313 [2018-12-08 10:39:21,428 INFO L226 Difference]: Without dead ends: 7313 [2018-12-08 10:39:21,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:39:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-12-08 10:39:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 6856. [2018-12-08 10:39:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6856 states. [2018-12-08 10:39:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6856 states to 6856 states and 15165 transitions. [2018-12-08 10:39:21,489 INFO L78 Accepts]: Start accepts. Automaton has 6856 states and 15165 transitions. Word has length 98 [2018-12-08 10:39:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:21,490 INFO L480 AbstractCegarLoop]: Abstraction has 6856 states and 15165 transitions. [2018-12-08 10:39:21,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:39:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 6856 states and 15165 transitions. [2018-12-08 10:39:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:21,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:21,494 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] [2018-12-08 10:39:21,494 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:21,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2018-12-08 10:39:21,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:21,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:21,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:39:21,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:21,606 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 10:39:21,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:21,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 10:39:21,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 10:39:21,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 10:39:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 10:39:21,607 INFO L87 Difference]: Start difference. First operand 6856 states and 15165 transitions. Second operand 10 states. [2018-12-08 10:39:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:21,959 INFO L93 Difference]: Finished difference Result 12036 states and 26654 transitions. [2018-12-08 10:39:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 10:39:21,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2018-12-08 10:39:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:21,965 INFO L225 Difference]: With dead ends: 12036 [2018-12-08 10:39:21,965 INFO L226 Difference]: Without dead ends: 8233 [2018-12-08 10:39:21,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-12-08 10:39:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8233 states. [2018-12-08 10:39:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8233 to 6837. [2018-12-08 10:39:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6837 states. [2018-12-08 10:39:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 15107 transitions. [2018-12-08 10:39:22,015 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 15107 transitions. Word has length 98 [2018-12-08 10:39:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:22,015 INFO L480 AbstractCegarLoop]: Abstraction has 6837 states and 15107 transitions. [2018-12-08 10:39:22,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 10:39:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 15107 transitions. [2018-12-08 10:39:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:22,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:22,020 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] [2018-12-08 10:39:22,020 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:22,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash -682671939, now seen corresponding path program 3 times [2018-12-08 10:39:22,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:22,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:22,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:39:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:39:22,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:22,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 10:39:22,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 10:39:22,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 10:39:22,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 10:39:22,113 INFO L87 Difference]: Start difference. First operand 6837 states and 15107 transitions. Second operand 10 states. [2018-12-08 10:39:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:22,563 INFO L93 Difference]: Finished difference Result 12084 states and 26746 transitions. [2018-12-08 10:39:22,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:39:22,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2018-12-08 10:39:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:22,568 INFO L225 Difference]: With dead ends: 12084 [2018-12-08 10:39:22,568 INFO L226 Difference]: Without dead ends: 4267 [2018-12-08 10:39:22,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-12-08 10:39:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2018-12-08 10:39:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4267. [2018-12-08 10:39:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2018-12-08 10:39:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 9470 transitions. [2018-12-08 10:39:22,604 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 9470 transitions. Word has length 98 [2018-12-08 10:39:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:22,605 INFO L480 AbstractCegarLoop]: Abstraction has 4267 states and 9470 transitions. [2018-12-08 10:39:22,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 10:39:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 9470 transitions. [2018-12-08 10:39:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:22,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:22,607 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] [2018-12-08 10:39:22,607 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:22,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2121145011, now seen corresponding path program 4 times [2018-12-08 10:39:22,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:22,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:22,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:22,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:39:22,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:22,722 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 10:39:22,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:22,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 10:39:22,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 10:39:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 10:39:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 10:39:22,723 INFO L87 Difference]: Start difference. First operand 4267 states and 9470 transitions. Second operand 11 states. [2018-12-08 10:39:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:23,630 INFO L93 Difference]: Finished difference Result 8508 states and 19055 transitions. [2018-12-08 10:39:23,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 10:39:23,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-08 10:39:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:23,634 INFO L225 Difference]: With dead ends: 8508 [2018-12-08 10:39:23,634 INFO L226 Difference]: Without dead ends: 5551 [2018-12-08 10:39:23,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-12-08 10:39:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2018-12-08 10:39:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 4300. [2018-12-08 10:39:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4300 states. [2018-12-08 10:39:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 9496 transitions. [2018-12-08 10:39:23,667 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 9496 transitions. Word has length 98 [2018-12-08 10:39:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:23,667 INFO L480 AbstractCegarLoop]: Abstraction has 4300 states and 9496 transitions. [2018-12-08 10:39:23,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 10:39:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 9496 transitions. [2018-12-08 10:39:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:23,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:23,670 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] [2018-12-08 10:39:23,670 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:23,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash -697818827, now seen corresponding path program 1 times [2018-12-08 10:39:23,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:23,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:23,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:23,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:39:23,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:23,773 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 10:39:23,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:23,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:39:23,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 10:39:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:39:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:39:23,774 INFO L87 Difference]: Start difference. First operand 4300 states and 9496 transitions. Second operand 8 states. [2018-12-08 10:39:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:23,988 INFO L93 Difference]: Finished difference Result 5023 states and 10984 transitions. [2018-12-08 10:39:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:39:23,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-12-08 10:39:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:23,991 INFO L225 Difference]: With dead ends: 5023 [2018-12-08 10:39:23,991 INFO L226 Difference]: Without dead ends: 5023 [2018-12-08 10:39:23,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:39:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2018-12-08 10:39:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4304. [2018-12-08 10:39:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4304 states. [2018-12-08 10:39:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4304 states to 4304 states and 9506 transitions. [2018-12-08 10:39:24,022 INFO L78 Accepts]: Start accepts. Automaton has 4304 states and 9506 transitions. Word has length 98 [2018-12-08 10:39:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:24,022 INFO L480 AbstractCegarLoop]: Abstraction has 4304 states and 9506 transitions. [2018-12-08 10:39:24,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 10:39:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4304 states and 9506 transitions. [2018-12-08 10:39:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:24,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:24,025 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] [2018-12-08 10:39:24,025 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:24,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1559092180, now seen corresponding path program 1 times [2018-12-08 10:39:24,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:24,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:24,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:24,127 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 10:39:24,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:24,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:39:24,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:39:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:39:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:39:24,128 INFO L87 Difference]: Start difference. First operand 4304 states and 9506 transitions. Second operand 7 states. [2018-12-08 10:39:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:24,280 INFO L93 Difference]: Finished difference Result 4557 states and 10002 transitions. [2018-12-08 10:39:24,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:39:24,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-08 10:39:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:24,283 INFO L225 Difference]: With dead ends: 4557 [2018-12-08 10:39:24,283 INFO L226 Difference]: Without dead ends: 4557 [2018-12-08 10:39:24,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:39:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2018-12-08 10:39:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4344. [2018-12-08 10:39:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2018-12-08 10:39:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 9578 transitions. [2018-12-08 10:39:24,312 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 9578 transitions. Word has length 98 [2018-12-08 10:39:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:24,312 INFO L480 AbstractCegarLoop]: Abstraction has 4344 states and 9578 transitions. [2018-12-08 10:39:24,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:39:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 9578 transitions. [2018-12-08 10:39:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:24,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:24,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:39:24,315 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:24,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash 766293748, now seen corresponding path program 1 times [2018-12-08 10:39:24,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:24,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:39:24,388 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 10:39:24,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:39:24,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:39:24,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:39:24,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:39:24,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:39:24,389 INFO L87 Difference]: Start difference. First operand 4344 states and 9578 transitions. Second operand 7 states. [2018-12-08 10:39:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:39:24,695 INFO L93 Difference]: Finished difference Result 5452 states and 11772 transitions. [2018-12-08 10:39:24,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 10:39:24,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-08 10:39:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:39:24,698 INFO L225 Difference]: With dead ends: 5452 [2018-12-08 10:39:24,698 INFO L226 Difference]: Without dead ends: 5452 [2018-12-08 10:39:24,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-12-08 10:39:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2018-12-08 10:39:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4633. [2018-12-08 10:39:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4633 states. [2018-12-08 10:39:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 10199 transitions. [2018-12-08 10:39:24,729 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 10199 transitions. Word has length 98 [2018-12-08 10:39:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:39:24,729 INFO L480 AbstractCegarLoop]: Abstraction has 4633 states and 10199 transitions. [2018-12-08 10:39:24,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:39:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 10199 transitions. [2018-12-08 10:39:24,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:39:24,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:39:24,732 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] [2018-12-08 10:39:24,732 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:39:24,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:39:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1271762541, now seen corresponding path program 5 times [2018-12-08 10:39:24,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:39:24,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:39:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:24,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:39:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:39:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:39:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:39:24,767 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 10:39:24,838 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 10:39:24,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:39:24 BasicIcfg [2018-12-08 10:39:24,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 10:39:24,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:39:24,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:39:24,839 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:39:24,839 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:39:06" (3/4) ... [2018-12-08 10:39:24,841 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 10:39:24,915 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d62c8a05-759f-4711-93e5-44d846d335aa/bin-2019/uautomizer/witness.graphml [2018-12-08 10:39:24,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:39:24,916 INFO L168 Benchmark]: Toolchain (without parser) took 19439.27 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 954.9 MB in the beginning and 785.7 MB in the end (delta: 169.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-08 10:39:24,917 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:39:24,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -95.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-08 10:39:24,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.61 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-08 10:39:24,917 INFO L168 Benchmark]: Boogie Preprocessor took 19.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:39:24,917 INFO L168 Benchmark]: RCFGBuilder took 351.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.1 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:39:24,917 INFO L168 Benchmark]: TraceAbstraction took 18644.20 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 992.1 MB in the beginning and 857.9 MB in the end (delta: 134.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-08 10:39:24,918 INFO L168 Benchmark]: Witness Printer took 76.29 ms. Allocated memory is still 2.8 GB. Free memory was 857.9 MB in the beginning and 785.7 MB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2018-12-08 10:39:24,919 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -95.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.61 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 351.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.1 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18644.20 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 992.1 MB in the beginning and 857.9 MB in the end (delta: 134.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 76.29 ms. Allocated memory is still 2.8 GB. Free memory was 857.9 MB in the beginning and 785.7 MB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L785] -1 pthread_t t243; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L786] FCALL, FORK -1 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t244; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L788] FCALL, FORK -1 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L751] EXPR 1 !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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L751] 1 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) [L752] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L752] 1 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)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L753] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L753] 1 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)) [L754] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L754] 1 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)) [L755] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L755] 1 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)) [L756] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L756] 1 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)) [L757] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L757] 1 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)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] -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) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] -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 [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -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 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 18.5s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9401 SDtfs, 10631 SDslu, 22468 SDs, 0 SdLazy, 9456 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 83 SyntacticMatches, 37 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34809occurred 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: 4.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 81292 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2832 NumberOfCodeBlocks, 2832 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2699 ConstructedInterpolants, 0 QuantifiedInterpolants, 625132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...