./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/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 3d42252203ae435c01e16559a298cce401c32dec ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-11-16 00:17:50,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:17:50,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:17:50,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:17:50,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:17:50,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:17:50,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:17:50,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:17:50,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:17:50,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:17:50,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:17:50,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:17:50,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:17:50,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:17:50,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:17:50,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:17:50,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:17:50,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:17:50,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:17:50,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:17:50,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:17:50,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:17:50,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:17:50,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:17:50,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:17:50,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:17:50,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:17:50,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:17:50,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:17:50,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:17:50,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:17:50,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:17:50,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:17:50,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:17:50,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:17:50,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:17:50,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:17:50,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:17:50,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:17:50,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:17:50,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:17:50,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:17:50,751 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:17:50,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:17:50,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:17:50,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:17:50,753 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:17:50,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:17:50,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:17:50,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:17:50,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:17:50,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:17:50,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:17:50,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:17:50,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:17:50,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:17:50,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:17:50,755 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:17:50,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:17:50,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:17:50,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:17:50,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:17:50,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:17:50,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:17:50,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:17:50,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:17:50,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:17:50,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:17:50,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:17:50,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:17:50,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/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 -> 3d42252203ae435c01e16559a298cce401c32dec [2019-11-16 00:17:50,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:17:50,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:17:50,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:17:50,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:17:50,819 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:17:50,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i [2019-11-16 00:17:50,874 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/data/16fcd9932/8aaf2382bebc4cee9b9e6762240e3804/FLAG2750825c5 [2019-11-16 00:17:51,332 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:17:51,333 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i [2019-11-16 00:17:51,347 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/data/16fcd9932/8aaf2382bebc4cee9b9e6762240e3804/FLAG2750825c5 [2019-11-16 00:17:51,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/data/16fcd9932/8aaf2382bebc4cee9b9e6762240e3804 [2019-11-16 00:17:51,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:17:51,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:17:51,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:17:51,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:17:51,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:17:51,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:51" (1/1) ... [2019-11-16 00:17:51,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20921137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:51, skipping insertion in model container [2019-11-16 00:17:51,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:51" (1/1) ... [2019-11-16 00:17:51,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:17:51,421 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:17:51,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:17:51,919 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:17:51,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:17:52,047 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:17:52,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52 WrapperNode [2019-11-16 00:17:52,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:17:52,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:17:52,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:17:52,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:17:52,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:17:52,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:17:52,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:17:52,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:17:52,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... [2019-11-16 00:17:52,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:17:52,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:17:52,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:17:52,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:17:52,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/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 [2019-11-16 00:17:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:17:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:17:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:17:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:17:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:17:52,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:17:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:17:52,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:17:52,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:17:52,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:17:52,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:17:52,237 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:17:53,169 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:17:53,170 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:17:53,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:53 BoogieIcfgContainer [2019-11-16 00:17:53,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:17:53,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:17:53,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:17:53,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:17:53,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:17:51" (1/3) ... [2019-11-16 00:17:53,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:53, skipping insertion in model container [2019-11-16 00:17:53,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:52" (2/3) ... [2019-11-16 00:17:53,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:53, skipping insertion in model container [2019-11-16 00:17:53,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:53" (3/3) ... [2019-11-16 00:17:53,178 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-11-16 00:17:53,224 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,224 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,225 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,225 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,225 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,225 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,226 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,226 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,226 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,227 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,227 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,227 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,227 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,228 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,228 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,228 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,234 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,234 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,234 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,234 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,234 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,235 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,235 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,235 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,235 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,236 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,236 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,236 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,236 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,237 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,237 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,237 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,237 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,237 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,238 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,238 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,238 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,238 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,239 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,239 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,239 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,239 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,240 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,240 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,240 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,240 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,240 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,241 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,241 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,241 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,241 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,242 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,242 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,242 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,242 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,243 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,243 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,243 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,243 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,244 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,244 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,244 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,244 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,245 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,245 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,245 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,245 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,245 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,246 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,246 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,246 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,246 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,247 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,247 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,247 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,247 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,247 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,248 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,248 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,248 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,248 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,249 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,249 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,249 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,249 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,250 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,250 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,250 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,250 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:17:53,270 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:17:53,271 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:17:53,281 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:17:53,291 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:17:53,310 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:17:53,311 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:17:53,311 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:17:53,311 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:17:53,311 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:17:53,311 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:17:53,312 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:17:53,312 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:17:53,325 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144 places, 182 transitions [2019-11-16 00:17:56,140 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-11-16 00:17:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-11-16 00:17:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:17:56,151 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:56,152 INFO L380 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] [2019-11-16 00:17:56,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash -867481609, now seen corresponding path program 1 times [2019-11-16 00:17:56,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:56,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499039315] [2019-11-16 00:17:56,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:56,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:56,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:56,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499039315] [2019-11-16 00:17:56,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:56,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:56,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331143987] [2019-11-16 00:17:56,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:56,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:56,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:56,457 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-11-16 00:17:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:57,440 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-11-16 00:17:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:57,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-16 00:17:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:57,703 INFO L225 Difference]: With dead ends: 33594 [2019-11-16 00:17:57,704 INFO L226 Difference]: Without dead ends: 25706 [2019-11-16 00:17:57,706 INFO L600 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 [2019-11-16 00:17:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-11-16 00:17:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-11-16 00:17:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-11-16 00:17:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-11-16 00:17:59,291 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-11-16 00:17:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:59,292 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-11-16 00:17:59,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-11-16 00:17:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:17:59,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:59,310 INFO L380 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] [2019-11-16 00:17:59,311 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:59,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1683273565, now seen corresponding path program 1 times [2019-11-16 00:17:59,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:59,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394582148] [2019-11-16 00:17:59,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:59,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:59,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:59,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394582148] [2019-11-16 00:17:59,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:59,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:59,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110929329] [2019-11-16 00:17:59,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:59,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:59,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:59,508 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-11-16 00:18:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:00,532 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-11-16 00:18:00,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:18:00,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-16 00:18:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:00,717 INFO L225 Difference]: With dead ends: 41084 [2019-11-16 00:18:00,718 INFO L226 Difference]: Without dead ends: 40548 [2019-11-16 00:18:00,719 INFO L600 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 [2019-11-16 00:18:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-11-16 00:18:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-11-16 00:18:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-11-16 00:18:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-11-16 00:18:02,367 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-11-16 00:18:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:02,377 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-11-16 00:18:02,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-11-16 00:18:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:18:02,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:02,387 INFO L380 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] [2019-11-16 00:18:02,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:02,388 INFO L82 PathProgramCache]: Analyzing trace with hash -506632681, now seen corresponding path program 1 times [2019-11-16 00:18:02,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:02,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975810516] [2019-11-16 00:18:02,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:02,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:02,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:02,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975810516] [2019-11-16 00:18:02,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:02,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:18:02,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238134983] [2019-11-16 00:18:02,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:18:02,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:02,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:02,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:02,488 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-11-16 00:18:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:03,096 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-11-16 00:18:03,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:18:03,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-16 00:18:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:03,944 INFO L225 Difference]: With dead ends: 49781 [2019-11-16 00:18:03,945 INFO L226 Difference]: Without dead ends: 49277 [2019-11-16 00:18:03,945 INFO L600 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 [2019-11-16 00:18:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-11-16 00:18:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-11-16 00:18:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-11-16 00:18:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-11-16 00:18:05,075 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-11-16 00:18:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:05,076 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-11-16 00:18:05,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-11-16 00:18:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:18:05,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:05,086 INFO L380 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] [2019-11-16 00:18:05,086 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:05,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:05,087 INFO L82 PathProgramCache]: Analyzing trace with hash -571471363, now seen corresponding path program 1 times [2019-11-16 00:18:05,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:05,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196533989] [2019-11-16 00:18:05,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:05,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:05,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:05,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196533989] [2019-11-16 00:18:05,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:05,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:05,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215146352] [2019-11-16 00:18:05,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:05,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:05,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:05,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:05,135 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-11-16 00:18:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:05,416 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-11-16 00:18:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:05,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:18:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:05,581 INFO L225 Difference]: With dead ends: 61090 [2019-11-16 00:18:05,581 INFO L226 Difference]: Without dead ends: 61090 [2019-11-16 00:18:05,581 INFO L600 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 [2019-11-16 00:18:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-11-16 00:18:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-11-16 00:18:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-11-16 00:18:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-11-16 00:18:07,357 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-11-16 00:18:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:07,357 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-11-16 00:18:07,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-11-16 00:18:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:18:07,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:07,373 INFO L380 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] [2019-11-16 00:18:07,373 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1136591846, now seen corresponding path program 1 times [2019-11-16 00:18:07,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:07,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139515370] [2019-11-16 00:18:07,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:07,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:07,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:07,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139515370] [2019-11-16 00:18:07,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:07,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:18:07,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086891715] [2019-11-16 00:18:07,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:18:07,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:18:07,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:18:07,513 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-11-16 00:18:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:09,307 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-11-16 00:18:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:18:09,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-16 00:18:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:09,455 INFO L225 Difference]: With dead ends: 63759 [2019-11-16 00:18:09,455 INFO L226 Difference]: Without dead ends: 63759 [2019-11-16 00:18:09,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-11-16 00:18:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-11-16 00:18:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-11-16 00:18:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-11-16 00:18:10,710 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-11-16 00:18:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:10,710 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-11-16 00:18:10,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:18:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-11-16 00:18:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:18:10,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:10,734 INFO L380 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] [2019-11-16 00:18:10,735 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:10,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash -660359513, now seen corresponding path program 1 times [2019-11-16 00:18:10,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:10,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006194407] [2019-11-16 00:18:10,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:10,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:10,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:10,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006194407] [2019-11-16 00:18:10,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:10,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:18:10,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117629627] [2019-11-16 00:18:10,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:18:10,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:10,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:18:10,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:18:10,855 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-11-16 00:18:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:12,365 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-11-16 00:18:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:18:12,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-16 00:18:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:15,902 INFO L225 Difference]: With dead ends: 83688 [2019-11-16 00:18:15,902 INFO L226 Difference]: Without dead ends: 83688 [2019-11-16 00:18:15,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:18:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-11-16 00:18:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-11-16 00:18:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-11-16 00:18:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-11-16 00:18:17,247 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-11-16 00:18:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:17,248 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-11-16 00:18:17,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:18:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-11-16 00:18:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:18:17,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:17,268 INFO L380 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] [2019-11-16 00:18:17,268 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:17,269 INFO L82 PathProgramCache]: Analyzing trace with hash 227144168, now seen corresponding path program 1 times [2019-11-16 00:18:17,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:17,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496421105] [2019-11-16 00:18:17,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:17,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:17,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:17,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496421105] [2019-11-16 00:18:17,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:17,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:17,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64553373] [2019-11-16 00:18:17,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:17,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:17,371 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 4 states. [2019-11-16 00:18:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:17,439 INFO L93 Difference]: Finished difference Result 12162 states and 37832 transitions. [2019-11-16 00:18:17,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:18:17,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-16 00:18:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:17,456 INFO L225 Difference]: With dead ends: 12162 [2019-11-16 00:18:17,456 INFO L226 Difference]: Without dead ends: 10677 [2019-11-16 00:18:17,456 INFO L600 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 [2019-11-16 00:18:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10677 states. [2019-11-16 00:18:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10677 to 10628. [2019-11-16 00:18:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10628 states. [2019-11-16 00:18:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10628 states to 10628 states and 32594 transitions. [2019-11-16 00:18:17,599 INFO L78 Accepts]: Start accepts. Automaton has 10628 states and 32594 transitions. Word has length 56 [2019-11-16 00:18:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:17,600 INFO L462 AbstractCegarLoop]: Abstraction has 10628 states and 32594 transitions. [2019-11-16 00:18:17,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10628 states and 32594 transitions. [2019-11-16 00:18:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:18:17,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:17,601 INFO L380 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] [2019-11-16 00:18:17,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1710341576, now seen corresponding path program 1 times [2019-11-16 00:18:17,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:17,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887059249] [2019-11-16 00:18:17,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:17,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:17,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:17,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887059249] [2019-11-16 00:18:17,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:17,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:18:17,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882959691] [2019-11-16 00:18:17,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:18:17,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:17,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:18:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:18:17,694 INFO L87 Difference]: Start difference. First operand 10628 states and 32594 transitions. Second operand 6 states. [2019-11-16 00:18:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:18,150 INFO L93 Difference]: Finished difference Result 13185 states and 39875 transitions. [2019-11-16 00:18:18,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:18:18,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-16 00:18:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:18,170 INFO L225 Difference]: With dead ends: 13185 [2019-11-16 00:18:18,170 INFO L226 Difference]: Without dead ends: 13122 [2019-11-16 00:18:18,170 INFO L600 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 [2019-11-16 00:18:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13122 states. [2019-11-16 00:18:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13122 to 11051. [2019-11-16 00:18:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11051 states. [2019-11-16 00:18:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11051 states to 11051 states and 33788 transitions. [2019-11-16 00:18:18,526 INFO L78 Accepts]: Start accepts. Automaton has 11051 states and 33788 transitions. Word has length 56 [2019-11-16 00:18:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:18,527 INFO L462 AbstractCegarLoop]: Abstraction has 11051 states and 33788 transitions. [2019-11-16 00:18:18,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:18:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 11051 states and 33788 transitions. [2019-11-16 00:18:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:18:18,535 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:18,535 INFO L380 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] [2019-11-16 00:18:18,536 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1211133860, now seen corresponding path program 1 times [2019-11-16 00:18:18,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:18,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531799650] [2019-11-16 00:18:18,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:18,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:18,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:18,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531799650] [2019-11-16 00:18:18,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:18,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:18,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183766233] [2019-11-16 00:18:18,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:18,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:18,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:18,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:18,599 INFO L87 Difference]: Start difference. First operand 11051 states and 33788 transitions. Second operand 4 states. [2019-11-16 00:18:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:18,737 INFO L93 Difference]: Finished difference Result 12865 states and 39394 transitions. [2019-11-16 00:18:18,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:18:18,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-16 00:18:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:18,757 INFO L225 Difference]: With dead ends: 12865 [2019-11-16 00:18:18,757 INFO L226 Difference]: Without dead ends: 12865 [2019-11-16 00:18:18,757 INFO L600 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 [2019-11-16 00:18:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12865 states. [2019-11-16 00:18:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12865 to 11696. [2019-11-16 00:18:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11696 states. [2019-11-16 00:18:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11696 states to 11696 states and 35765 transitions. [2019-11-16 00:18:18,925 INFO L78 Accepts]: Start accepts. Automaton has 11696 states and 35765 transitions. Word has length 64 [2019-11-16 00:18:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:18,925 INFO L462 AbstractCegarLoop]: Abstraction has 11696 states and 35765 transitions. [2019-11-16 00:18:18,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11696 states and 35765 transitions. [2019-11-16 00:18:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:18:18,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:18,930 INFO L380 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] [2019-11-16 00:18:18,930 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1341023101, now seen corresponding path program 1 times [2019-11-16 00:18:18,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:18,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875761471] [2019-11-16 00:18:18,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:18,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:18,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:19,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875761471] [2019-11-16 00:18:19,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:19,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:18:19,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440447915] [2019-11-16 00:18:19,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:18:19,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:19,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:18:19,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:18:19,019 INFO L87 Difference]: Start difference. First operand 11696 states and 35765 transitions. Second operand 6 states. [2019-11-16 00:18:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:19,446 INFO L93 Difference]: Finished difference Result 14222 states and 42863 transitions. [2019-11-16 00:18:19,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:18:19,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-16 00:18:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:19,474 INFO L225 Difference]: With dead ends: 14222 [2019-11-16 00:18:19,475 INFO L226 Difference]: Without dead ends: 14161 [2019-11-16 00:18:19,481 INFO L600 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 [2019-11-16 00:18:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14161 states. [2019-11-16 00:18:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 13464. [2019-11-16 00:18:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13464 states. [2019-11-16 00:18:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13464 states to 13464 states and 40782 transitions. [2019-11-16 00:18:19,693 INFO L78 Accepts]: Start accepts. Automaton has 13464 states and 40782 transitions. Word has length 64 [2019-11-16 00:18:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:19,694 INFO L462 AbstractCegarLoop]: Abstraction has 13464 states and 40782 transitions. [2019-11-16 00:18:19,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:18:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 13464 states and 40782 transitions. [2019-11-16 00:18:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:18:19,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:19,700 INFO L380 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] [2019-11-16 00:18:19,701 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash 733516216, now seen corresponding path program 1 times [2019-11-16 00:18:19,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:19,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983561787] [2019-11-16 00:18:19,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:19,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:19,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:19,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983561787] [2019-11-16 00:18:19,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:19,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:19,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387853749] [2019-11-16 00:18:19,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:19,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:19,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:19,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:19,786 INFO L87 Difference]: Start difference. First operand 13464 states and 40782 transitions. Second operand 4 states. [2019-11-16 00:18:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:20,109 INFO L93 Difference]: Finished difference Result 16506 states and 49374 transitions. [2019-11-16 00:18:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:20,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:18:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:20,134 INFO L225 Difference]: With dead ends: 16506 [2019-11-16 00:18:20,134 INFO L226 Difference]: Without dead ends: 16506 [2019-11-16 00:18:20,135 INFO L600 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 [2019-11-16 00:18:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16506 states. [2019-11-16 00:18:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16506 to 14985. [2019-11-16 00:18:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14985 states. [2019-11-16 00:18:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14985 states to 14985 states and 44963 transitions. [2019-11-16 00:18:20,349 INFO L78 Accepts]: Start accepts. Automaton has 14985 states and 44963 transitions. Word has length 68 [2019-11-16 00:18:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:20,349 INFO L462 AbstractCegarLoop]: Abstraction has 14985 states and 44963 transitions. [2019-11-16 00:18:20,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 14985 states and 44963 transitions. [2019-11-16 00:18:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:18:20,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:20,357 INFO L380 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] [2019-11-16 00:18:20,357 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:20,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:20,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1343693127, now seen corresponding path program 1 times [2019-11-16 00:18:20,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:20,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532865966] [2019-11-16 00:18:20,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:20,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:20,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:20,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532865966] [2019-11-16 00:18:20,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:20,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:20,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671905055] [2019-11-16 00:18:20,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:20,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:20,408 INFO L87 Difference]: Start difference. First operand 14985 states and 44963 transitions. Second operand 3 states. [2019-11-16 00:18:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:20,605 INFO L93 Difference]: Finished difference Result 15533 states and 46406 transitions. [2019-11-16 00:18:20,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:20,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-16 00:18:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:20,628 INFO L225 Difference]: With dead ends: 15533 [2019-11-16 00:18:20,628 INFO L226 Difference]: Without dead ends: 15533 [2019-11-16 00:18:20,628 INFO L600 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 [2019-11-16 00:18:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15533 states. [2019-11-16 00:18:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15533 to 15279. [2019-11-16 00:18:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15279 states. [2019-11-16 00:18:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15279 states to 15279 states and 45731 transitions. [2019-11-16 00:18:20,834 INFO L78 Accepts]: Start accepts. Automaton has 15279 states and 45731 transitions. Word has length 68 [2019-11-16 00:18:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:20,834 INFO L462 AbstractCegarLoop]: Abstraction has 15279 states and 45731 transitions. [2019-11-16 00:18:20,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 15279 states and 45731 transitions. [2019-11-16 00:18:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:18:20,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:20,844 INFO L380 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] [2019-11-16 00:18:20,844 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:20,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1828943938, now seen corresponding path program 1 times [2019-11-16 00:18:20,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:20,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258141483] [2019-11-16 00:18:20,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:20,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:20,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:20,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258141483] [2019-11-16 00:18:20,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:20,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:18:20,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31467206] [2019-11-16 00:18:20,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:18:20,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:20,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:18:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:20,960 INFO L87 Difference]: Start difference. First operand 15279 states and 45731 transitions. Second operand 8 states. [2019-11-16 00:18:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:23,159 INFO L93 Difference]: Finished difference Result 48056 states and 141062 transitions. [2019-11-16 00:18:23,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:18:23,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-11-16 00:18:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:23,234 INFO L225 Difference]: With dead ends: 48056 [2019-11-16 00:18:23,234 INFO L226 Difference]: Without dead ends: 47906 [2019-11-16 00:18:23,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:18:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47906 states. [2019-11-16 00:18:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47906 to 21960. [2019-11-16 00:18:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21960 states. [2019-11-16 00:18:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21960 states to 21960 states and 65743 transitions. [2019-11-16 00:18:23,745 INFO L78 Accepts]: Start accepts. Automaton has 21960 states and 65743 transitions. Word has length 70 [2019-11-16 00:18:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:23,745 INFO L462 AbstractCegarLoop]: Abstraction has 21960 states and 65743 transitions. [2019-11-16 00:18:23,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:18:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21960 states and 65743 transitions. [2019-11-16 00:18:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:18:23,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:23,759 INFO L380 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] [2019-11-16 00:18:23,760 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:23,760 INFO L82 PathProgramCache]: Analyzing trace with hash -21489475, now seen corresponding path program 1 times [2019-11-16 00:18:23,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:23,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372778095] [2019-11-16 00:18:23,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:23,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:23,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:23,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372778095] [2019-11-16 00:18:23,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:23,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:18:23,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10348067] [2019-11-16 00:18:23,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:18:23,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:23,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:18:23,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:18:23,866 INFO L87 Difference]: Start difference. First operand 21960 states and 65743 transitions. Second operand 6 states. [2019-11-16 00:18:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:24,623 INFO L93 Difference]: Finished difference Result 22857 states and 67869 transitions. [2019-11-16 00:18:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:18:24,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-16 00:18:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:24,657 INFO L225 Difference]: With dead ends: 22857 [2019-11-16 00:18:24,657 INFO L226 Difference]: Without dead ends: 22857 [2019-11-16 00:18:24,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-11-16 00:18:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 22415. [2019-11-16 00:18:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22415 states. [2019-11-16 00:18:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22415 states to 22415 states and 66697 transitions. [2019-11-16 00:18:24,957 INFO L78 Accepts]: Start accepts. Automaton has 22415 states and 66697 transitions. Word has length 70 [2019-11-16 00:18:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:24,958 INFO L462 AbstractCegarLoop]: Abstraction has 22415 states and 66697 transitions. [2019-11-16 00:18:24,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:18:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22415 states and 66697 transitions. [2019-11-16 00:18:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:18:24,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:24,971 INFO L380 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] [2019-11-16 00:18:24,971 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2098698818, now seen corresponding path program 1 times [2019-11-16 00:18:24,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:24,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044992130] [2019-11-16 00:18:24,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:24,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:24,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:25,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044992130] [2019-11-16 00:18:25,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:25,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:18:25,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59002014] [2019-11-16 00:18:25,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:18:25,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:25,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:18:25,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:18:25,078 INFO L87 Difference]: Start difference. First operand 22415 states and 66697 transitions. Second operand 6 states. [2019-11-16 00:18:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:25,432 INFO L93 Difference]: Finished difference Result 20201 states and 58714 transitions. [2019-11-16 00:18:25,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:18:25,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-16 00:18:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:25,460 INFO L225 Difference]: With dead ends: 20201 [2019-11-16 00:18:25,460 INFO L226 Difference]: Without dead ends: 20201 [2019-11-16 00:18:25,461 INFO L600 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 [2019-11-16 00:18:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20201 states. [2019-11-16 00:18:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20201 to 19005. [2019-11-16 00:18:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19005 states. [2019-11-16 00:18:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19005 states to 19005 states and 55678 transitions. [2019-11-16 00:18:25,721 INFO L78 Accepts]: Start accepts. Automaton has 19005 states and 55678 transitions. Word has length 70 [2019-11-16 00:18:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:25,722 INFO L462 AbstractCegarLoop]: Abstraction has 19005 states and 55678 transitions. [2019-11-16 00:18:25,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:18:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19005 states and 55678 transitions. [2019-11-16 00:18:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:18:25,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:25,733 INFO L380 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] [2019-11-16 00:18:25,733 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:25,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash 600164928, now seen corresponding path program 1 times [2019-11-16 00:18:25,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:25,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167572434] [2019-11-16 00:18:25,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:25,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:25,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:25,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167572434] [2019-11-16 00:18:25,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:25,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:25,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353406483] [2019-11-16 00:18:25,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:25,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:25,817 INFO L87 Difference]: Start difference. First operand 19005 states and 55678 transitions. Second operand 4 states. [2019-11-16 00:18:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:26,288 INFO L93 Difference]: Finished difference Result 25536 states and 75191 transitions. [2019-11-16 00:18:26,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:18:26,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-16 00:18:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:26,328 INFO L225 Difference]: With dead ends: 25536 [2019-11-16 00:18:26,328 INFO L226 Difference]: Without dead ends: 25401 [2019-11-16 00:18:26,328 INFO L600 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 [2019-11-16 00:18:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25401 states. [2019-11-16 00:18:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25401 to 22554. [2019-11-16 00:18:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22554 states. [2019-11-16 00:18:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22554 states to 22554 states and 66526 transitions. [2019-11-16 00:18:26,652 INFO L78 Accepts]: Start accepts. Automaton has 22554 states and 66526 transitions. Word has length 70 [2019-11-16 00:18:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:26,652 INFO L462 AbstractCegarLoop]: Abstraction has 22554 states and 66526 transitions. [2019-11-16 00:18:26,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 22554 states and 66526 transitions. [2019-11-16 00:18:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:18:26,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:26,662 INFO L380 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] [2019-11-16 00:18:26,662 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1887347905, now seen corresponding path program 1 times [2019-11-16 00:18:26,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:26,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087667162] [2019-11-16 00:18:26,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:26,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:26,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:26,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087667162] [2019-11-16 00:18:26,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:26,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:18:26,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771962551] [2019-11-16 00:18:26,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:18:26,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:26,743 INFO L87 Difference]: Start difference. First operand 22554 states and 66526 transitions. Second operand 5 states. [2019-11-16 00:18:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:27,262 INFO L93 Difference]: Finished difference Result 32545 states and 94756 transitions. [2019-11-16 00:18:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:18:27,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-16 00:18:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:27,314 INFO L225 Difference]: With dead ends: 32545 [2019-11-16 00:18:27,314 INFO L226 Difference]: Without dead ends: 32443 [2019-11-16 00:18:27,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32443 states. [2019-11-16 00:18:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32443 to 26202. [2019-11-16 00:18:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26202 states. [2019-11-16 00:18:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26202 states to 26202 states and 76700 transitions. [2019-11-16 00:18:27,721 INFO L78 Accepts]: Start accepts. Automaton has 26202 states and 76700 transitions. Word has length 70 [2019-11-16 00:18:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:27,721 INFO L462 AbstractCegarLoop]: Abstraction has 26202 states and 76700 transitions. [2019-11-16 00:18:27,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 26202 states and 76700 transitions. [2019-11-16 00:18:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:18:27,732 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:27,732 INFO L380 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] [2019-11-16 00:18:27,732 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1196786431, now seen corresponding path program 1 times [2019-11-16 00:18:27,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:27,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206843473] [2019-11-16 00:18:27,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:27,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:27,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:27,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206843473] [2019-11-16 00:18:27,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:27,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:18:27,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32119074] [2019-11-16 00:18:27,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:18:27,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:27,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:27,842 INFO L87 Difference]: Start difference. First operand 26202 states and 76700 transitions. Second operand 5 states. [2019-11-16 00:18:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:27,956 INFO L93 Difference]: Finished difference Result 20838 states and 57527 transitions. [2019-11-16 00:18:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:18:27,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-16 00:18:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:27,992 INFO L225 Difference]: With dead ends: 20838 [2019-11-16 00:18:27,992 INFO L226 Difference]: Without dead ends: 20838 [2019-11-16 00:18:27,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:18:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20838 states. [2019-11-16 00:18:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20838 to 16319. [2019-11-16 00:18:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16319 states. [2019-11-16 00:18:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16319 states to 16319 states and 44929 transitions. [2019-11-16 00:18:28,235 INFO L78 Accepts]: Start accepts. Automaton has 16319 states and 44929 transitions. Word has length 70 [2019-11-16 00:18:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:28,236 INFO L462 AbstractCegarLoop]: Abstraction has 16319 states and 44929 transitions. [2019-11-16 00:18:28,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16319 states and 44929 transitions. [2019-11-16 00:18:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:18:28,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:28,243 INFO L380 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] [2019-11-16 00:18:28,243 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash -309282750, now seen corresponding path program 1 times [2019-11-16 00:18:28,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:28,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969751217] [2019-11-16 00:18:28,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:28,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:28,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:28,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969751217] [2019-11-16 00:18:28,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:28,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:18:28,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137198191] [2019-11-16 00:18:28,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:18:28,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:28,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:28,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:28,340 INFO L87 Difference]: Start difference. First operand 16319 states and 44929 transitions. Second operand 5 states. [2019-11-16 00:18:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:28,394 INFO L93 Difference]: Finished difference Result 5240 states and 12376 transitions. [2019-11-16 00:18:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:18:28,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-16 00:18:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:28,400 INFO L225 Difference]: With dead ends: 5240 [2019-11-16 00:18:28,400 INFO L226 Difference]: Without dead ends: 4484 [2019-11-16 00:18:28,401 INFO L600 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 [2019-11-16 00:18:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2019-11-16 00:18:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 3826. [2019-11-16 00:18:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-11-16 00:18:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 8841 transitions. [2019-11-16 00:18:28,447 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 8841 transitions. Word has length 70 [2019-11-16 00:18:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:28,448 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 8841 transitions. [2019-11-16 00:18:28,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 8841 transitions. [2019-11-16 00:18:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:18:28,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:28,451 INFO L380 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] [2019-11-16 00:18:28,451 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash -687461772, now seen corresponding path program 1 times [2019-11-16 00:18:28,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:28,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90600442] [2019-11-16 00:18:28,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:28,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:28,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:28,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90600442] [2019-11-16 00:18:28,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:28,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:28,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017069942] [2019-11-16 00:18:28,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:28,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:28,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:28,484 INFO L87 Difference]: Start difference. First operand 3826 states and 8841 transitions. Second operand 3 states. [2019-11-16 00:18:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:28,510 INFO L93 Difference]: Finished difference Result 4602 states and 10465 transitions. [2019-11-16 00:18:28,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:28,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-16 00:18:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:28,514 INFO L225 Difference]: With dead ends: 4602 [2019-11-16 00:18:28,514 INFO L226 Difference]: Without dead ends: 4602 [2019-11-16 00:18:28,514 INFO L600 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 [2019-11-16 00:18:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2019-11-16 00:18:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 3761. [2019-11-16 00:18:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2019-11-16 00:18:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 8474 transitions. [2019-11-16 00:18:28,575 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 8474 transitions. Word has length 70 [2019-11-16 00:18:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:28,576 INFO L462 AbstractCegarLoop]: Abstraction has 3761 states and 8474 transitions. [2019-11-16 00:18:28,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 8474 transitions. [2019-11-16 00:18:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:18:28,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:28,579 INFO L380 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] [2019-11-16 00:18:28,579 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:28,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:28,579 INFO L82 PathProgramCache]: Analyzing trace with hash -61024697, now seen corresponding path program 1 times [2019-11-16 00:18:28,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:28,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136781586] [2019-11-16 00:18:28,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:28,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:28,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:28,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136781586] [2019-11-16 00:18:28,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:28,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:18:28,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134139259] [2019-11-16 00:18:28,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:18:28,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:28,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:28,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:28,645 INFO L87 Difference]: Start difference. First operand 3761 states and 8474 transitions. Second operand 5 states. [2019-11-16 00:18:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:28,861 INFO L93 Difference]: Finished difference Result 4686 states and 10612 transitions. [2019-11-16 00:18:28,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:18:28,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-11-16 00:18:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:28,866 INFO L225 Difference]: With dead ends: 4686 [2019-11-16 00:18:28,866 INFO L226 Difference]: Without dead ends: 4686 [2019-11-16 00:18:28,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:18:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states. [2019-11-16 00:18:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 4327. [2019-11-16 00:18:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2019-11-16 00:18:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 9753 transitions. [2019-11-16 00:18:28,908 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 9753 transitions. Word has length 76 [2019-11-16 00:18:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:28,909 INFO L462 AbstractCegarLoop]: Abstraction has 4327 states and 9753 transitions. [2019-11-16 00:18:28,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 9753 transitions. [2019-11-16 00:18:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:18:28,912 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:28,913 INFO L380 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] [2019-11-16 00:18:28,913 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1681785638, now seen corresponding path program 1 times [2019-11-16 00:18:28,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:28,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855157499] [2019-11-16 00:18:28,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:28,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:28,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:28,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855157499] [2019-11-16 00:18:28,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:28,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:18:28,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895831010] [2019-11-16 00:18:28,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:18:28,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:18:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:18:28,984 INFO L87 Difference]: Start difference. First operand 4327 states and 9753 transitions. Second operand 7 states. [2019-11-16 00:18:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:29,352 INFO L93 Difference]: Finished difference Result 4977 states and 11120 transitions. [2019-11-16 00:18:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:18:29,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-11-16 00:18:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:29,356 INFO L225 Difference]: With dead ends: 4977 [2019-11-16 00:18:29,356 INFO L226 Difference]: Without dead ends: 4924 [2019-11-16 00:18:29,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:18:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2019-11-16 00:18:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 4351. [2019-11-16 00:18:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4351 states. [2019-11-16 00:18:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 9730 transitions. [2019-11-16 00:18:29,400 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 9730 transitions. Word has length 76 [2019-11-16 00:18:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:29,400 INFO L462 AbstractCegarLoop]: Abstraction has 4351 states and 9730 transitions. [2019-11-16 00:18:29,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:18:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 9730 transitions. [2019-11-16 00:18:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:18:29,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:29,404 INFO L380 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] [2019-11-16 00:18:29,404 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:29,404 INFO L82 PathProgramCache]: Analyzing trace with hash 419314387, now seen corresponding path program 1 times [2019-11-16 00:18:29,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:29,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062937482] [2019-11-16 00:18:29,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:29,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:29,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:29,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062937482] [2019-11-16 00:18:29,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:29,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:29,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303457644] [2019-11-16 00:18:29,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:29,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:29,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:29,478 INFO L87 Difference]: Start difference. First operand 4351 states and 9730 transitions. Second operand 4 states. [2019-11-16 00:18:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:29,592 INFO L93 Difference]: Finished difference Result 5177 states and 11484 transitions. [2019-11-16 00:18:29,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:29,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-16 00:18:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:29,596 INFO L225 Difference]: With dead ends: 5177 [2019-11-16 00:18:29,596 INFO L226 Difference]: Without dead ends: 5177 [2019-11-16 00:18:29,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2019-11-16 00:18:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 4738. [2019-11-16 00:18:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4738 states. [2019-11-16 00:18:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4738 states to 4738 states and 10543 transitions. [2019-11-16 00:18:29,645 INFO L78 Accepts]: Start accepts. Automaton has 4738 states and 10543 transitions. Word has length 97 [2019-11-16 00:18:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:29,645 INFO L462 AbstractCegarLoop]: Abstraction has 4738 states and 10543 transitions. [2019-11-16 00:18:29,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4738 states and 10543 transitions. [2019-11-16 00:18:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:18:29,651 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:29,651 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:29,651 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:29,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash -228963575, now seen corresponding path program 1 times [2019-11-16 00:18:29,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:29,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63460629] [2019-11-16 00:18:29,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:29,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:29,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:29,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63460629] [2019-11-16 00:18:29,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:29,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:18:29,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943086775] [2019-11-16 00:18:29,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:18:29,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:29,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:29,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:29,728 INFO L87 Difference]: Start difference. First operand 4738 states and 10543 transitions. Second operand 5 states. [2019-11-16 00:18:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:29,853 INFO L93 Difference]: Finished difference Result 5006 states and 11146 transitions. [2019-11-16 00:18:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:18:29,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-16 00:18:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:29,860 INFO L225 Difference]: With dead ends: 5006 [2019-11-16 00:18:29,860 INFO L226 Difference]: Without dead ends: 5006 [2019-11-16 00:18:29,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:18:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5006 states. [2019-11-16 00:18:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5006 to 4029. [2019-11-16 00:18:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4029 states. [2019-11-16 00:18:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 4029 states and 8928 transitions. [2019-11-16 00:18:29,920 INFO L78 Accepts]: Start accepts. Automaton has 4029 states and 8928 transitions. Word has length 99 [2019-11-16 00:18:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:29,920 INFO L462 AbstractCegarLoop]: Abstraction has 4029 states and 8928 transitions. [2019-11-16 00:18:29,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4029 states and 8928 transitions. [2019-11-16 00:18:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:18:29,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:29,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:29,926 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:29,926 INFO L82 PathProgramCache]: Analyzing trace with hash 796528424, now seen corresponding path program 1 times [2019-11-16 00:18:29,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:29,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232425881] [2019-11-16 00:18:29,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:29,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:29,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:30,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232425881] [2019-11-16 00:18:30,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:30,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:18:30,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108204356] [2019-11-16 00:18:30,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:18:30,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:30,014 INFO L87 Difference]: Start difference. First operand 4029 states and 8928 transitions. Second operand 5 states. [2019-11-16 00:18:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:30,306 INFO L93 Difference]: Finished difference Result 5320 states and 11715 transitions. [2019-11-16 00:18:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:18:30,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-16 00:18:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:30,311 INFO L225 Difference]: With dead ends: 5320 [2019-11-16 00:18:30,311 INFO L226 Difference]: Without dead ends: 5176 [2019-11-16 00:18:30,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:18:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2019-11-16 00:18:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 4816. [2019-11-16 00:18:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4816 states. [2019-11-16 00:18:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 10633 transitions. [2019-11-16 00:18:30,360 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 10633 transitions. Word has length 99 [2019-11-16 00:18:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:30,360 INFO L462 AbstractCegarLoop]: Abstraction has 4816 states and 10633 transitions. [2019-11-16 00:18:30,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 10633 transitions. [2019-11-16 00:18:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:18:30,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:30,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:30,367 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -934410969, now seen corresponding path program 1 times [2019-11-16 00:18:30,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:30,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217988659] [2019-11-16 00:18:30,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:30,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:30,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:30,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217988659] [2019-11-16 00:18:30,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:30,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:18:30,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916384986] [2019-11-16 00:18:30,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:18:30,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:30,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:30,445 INFO L87 Difference]: Start difference. First operand 4816 states and 10633 transitions. Second operand 5 states. [2019-11-16 00:18:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:30,680 INFO L93 Difference]: Finished difference Result 5996 states and 13055 transitions. [2019-11-16 00:18:30,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:18:30,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-16 00:18:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:30,686 INFO L225 Difference]: With dead ends: 5996 [2019-11-16 00:18:30,686 INFO L226 Difference]: Without dead ends: 5978 [2019-11-16 00:18:30,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2019-11-16 00:18:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 4880. [2019-11-16 00:18:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4880 states. [2019-11-16 00:18:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 10741 transitions. [2019-11-16 00:18:30,739 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 10741 transitions. Word has length 99 [2019-11-16 00:18:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:30,739 INFO L462 AbstractCegarLoop]: Abstraction has 4880 states and 10741 transitions. [2019-11-16 00:18:30,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:18:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 10741 transitions. [2019-11-16 00:18:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:18:30,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:30,744 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:30,744 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1163911159, now seen corresponding path program 1 times [2019-11-16 00:18:30,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:30,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713139686] [2019-11-16 00:18:30,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:30,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:30,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:30,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713139686] [2019-11-16 00:18:30,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:30,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:18:30,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319472875] [2019-11-16 00:18:30,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:18:30,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:18:30,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:18:30,839 INFO L87 Difference]: Start difference. First operand 4880 states and 10741 transitions. Second operand 6 states. [2019-11-16 00:18:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:31,056 INFO L93 Difference]: Finished difference Result 5242 states and 11463 transitions. [2019-11-16 00:18:31,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:18:31,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-16 00:18:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:31,062 INFO L225 Difference]: With dead ends: 5242 [2019-11-16 00:18:31,062 INFO L226 Difference]: Without dead ends: 5242 [2019-11-16 00:18:31,063 INFO L600 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 [2019-11-16 00:18:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2019-11-16 00:18:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 4858. [2019-11-16 00:18:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4858 states. [2019-11-16 00:18:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 10670 transitions. [2019-11-16 00:18:31,133 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 10670 transitions. Word has length 99 [2019-11-16 00:18:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:31,133 INFO L462 AbstractCegarLoop]: Abstraction has 4858 states and 10670 transitions. [2019-11-16 00:18:31,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:18:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 10670 transitions. [2019-11-16 00:18:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:18:31,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:31,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:31,140 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2089159690, now seen corresponding path program 1 times [2019-11-16 00:18:31,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:31,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431095245] [2019-11-16 00:18:31,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:31,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:31,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:31,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431095245] [2019-11-16 00:18:31,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:31,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:18:31,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802712212] [2019-11-16 00:18:31,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:18:31,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:31,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:18:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:18:31,356 INFO L87 Difference]: Start difference. First operand 4858 states and 10670 transitions. Second operand 10 states. [2019-11-16 00:18:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:31,901 INFO L93 Difference]: Finished difference Result 13784 states and 30719 transitions. [2019-11-16 00:18:31,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:18:31,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-11-16 00:18:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:31,913 INFO L225 Difference]: With dead ends: 13784 [2019-11-16 00:18:31,913 INFO L226 Difference]: Without dead ends: 9644 [2019-11-16 00:18:31,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:18:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2019-11-16 00:18:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 4882. [2019-11-16 00:18:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4882 states. [2019-11-16 00:18:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 10665 transitions. [2019-11-16 00:18:32,010 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 10665 transitions. Word has length 99 [2019-11-16 00:18:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:32,011 INFO L462 AbstractCegarLoop]: Abstraction has 4882 states and 10665 transitions. [2019-11-16 00:18:32,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:18:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 10665 transitions. [2019-11-16 00:18:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:18:32,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:32,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:32,017 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1220070494, now seen corresponding path program 2 times [2019-11-16 00:18:32,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:32,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835935612] [2019-11-16 00:18:32,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:32,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:32,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:32,136 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:18:32,136 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:18:32,333 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:18:32,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:18:32 BasicIcfg [2019-11-16 00:18:32,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:18:32,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:18:32,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:18:32,350 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:18:32,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:53" (3/4) ... [2019-11-16 00:18:32,353 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:18:32,523 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2979d494-34e0-47c8-8407-55e6002928a4/bin/uautomizer/witness.graphml [2019-11-16 00:18:32,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:18:32,525 INFO L168 Benchmark]: Toolchain (without parser) took 41160.44 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 940.7 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:18:32,526 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:18:32,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:32,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:32,527 INFO L168 Benchmark]: Boogie Preprocessor took 41.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:18:32,527 INFO L168 Benchmark]: RCFGBuilder took 1021.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:32,528 INFO L168 Benchmark]: TraceAbstraction took 39176.63 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-16 00:18:32,528 INFO L168 Benchmark]: Witness Printer took 174.31 ms. Allocated memory is still 4.5 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:32,530 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 682.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1021.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39176.63 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 174.31 ms. Allocated memory is still 4.5 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 67.2 MB). Peak memory consumption was 67.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: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 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] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L706] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L707] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L708] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L709] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L710] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L711] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L712] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L713] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L714] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L715] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L716] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L717] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L718] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L813] 0 pthread_t t833; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t833, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L815] 0 pthread_t t834; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L783] EXPR 2 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$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, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$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, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] EXPR 2 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 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, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L818] 0 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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. Result: UNSAFE, OverallTime: 39.0s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8360 SDtfs, 9455 SDslu, 17827 SDs, 0 SdLazy, 7494 SolverSat, 466 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 84 SyntacticMatches, 12 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 95171 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2079 NumberOfCodeBlocks, 2079 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1952 ConstructedInterpolants, 0 QuantifiedInterpolants, 372391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...