./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_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_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/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 7a0c04adec756cefd794d8958a9954363bf4bc8f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-15 23:59:42,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:59:42,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:59:42,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:59:42,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:59:42,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:59:42,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:59:42,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:59:42,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:59:42,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:59:42,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:59:42,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:59:42,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:59:42,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:59:42,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:59:42,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:59:42,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:59:42,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:59:42,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:59:42,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:59:42,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:59:42,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:59:42,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:59:42,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:59:42,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:59:42,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:59:42,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:59:42,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:59:42,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:59:42,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:59:42,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:59:42,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:59:42,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:59:42,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:59:42,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:59:42,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:59:42,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:59:42,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:59:42,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:59:42,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:59:42,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:59:42,096 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:59:42,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:59:42,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:59:42,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:59:42,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:59:42,110 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:59:42,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:59:42,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:59:42,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:59:42,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:59:42,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:59:42,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:59:42,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:59:42,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:59:42,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:59:42,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:59:42,113 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:59:42,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:59:42,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:59:42,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:59:42,114 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:59:42,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:59:42,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:59:42,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:59:42,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:59:42,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:59:42,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:59:42,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:59:42,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:59:42,116 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_4841210b-00e9-47fd-811c-449f0afa9328/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 -> 7a0c04adec756cefd794d8958a9954363bf4bc8f [2019-11-15 23:59:42,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:59:42,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:59:42,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:59:42,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:59:42,158 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:59:42,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix009_power.oepc.i [2019-11-15 23:59:42,212 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/data/88fa21492/bb85bf55c19f4b2a8bfe47a77bbd6a0a/FLAGd9074c09e [2019-11-15 23:59:42,683 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:59:42,688 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/sv-benchmarks/c/pthread-wmm/mix009_power.oepc.i [2019-11-15 23:59:42,703 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/data/88fa21492/bb85bf55c19f4b2a8bfe47a77bbd6a0a/FLAGd9074c09e [2019-11-15 23:59:43,178 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/data/88fa21492/bb85bf55c19f4b2a8bfe47a77bbd6a0a [2019-11-15 23:59:43,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:59:43,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:59:43,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:59:43,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:59:43,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:59:43,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639d099c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43, skipping insertion in model container [2019-11-15 23:59:43,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,196 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:59:43,242 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:59:43,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:59:43,653 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:59:43,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:59:43,820 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:59:43,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43 WrapperNode [2019-11-15 23:59:43,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:59:43,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:59:43,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:59:43,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:59:43,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:59:43,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:59:43,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:59:43,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:59:43,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... [2019-11-15 23:59:43,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:59:43,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:59:43,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:59:43,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:59:43,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/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-15 23:59:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:59:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:59:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:59:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:59:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:59:44,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:59:44,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:59:44,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:59:44,006 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:59:44,889 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:59:44,889 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:59:44,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:59:44 BoogieIcfgContainer [2019-11-15 23:59:44,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:59:44,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:59:44,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:59:44,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:59:44,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:59:43" (1/3) ... [2019-11-15 23:59:44,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115bbf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:59:44, skipping insertion in model container [2019-11-15 23:59:44,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:43" (2/3) ... [2019-11-15 23:59:44,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115bbf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:59:44, skipping insertion in model container [2019-11-15 23:59:44,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:59:44" (3/3) ... [2019-11-15 23:59:44,898 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc.i [2019-11-15 23:59:44,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,937 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,937 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,937 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,938 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,938 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,944 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,944 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,944 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,944 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,944 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,945 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,945 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,945 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,945 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,945 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,945 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,946 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,946 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,946 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,946 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,946 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,947 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,947 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,947 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,947 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,947 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,947 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,948 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,948 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,948 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,948 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,948 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,949 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,949 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,949 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,949 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,949 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,950 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,950 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,950 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,950 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,950 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,950 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,952 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,952 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,952 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,952 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,952 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,960 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,960 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,960 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,960 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,960 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,960 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,965 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,965 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,965 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,965 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:44,981 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:59:44,981 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:59:44,989 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:59:45,000 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:59:45,018 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:59:45,018 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:59:45,018 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:59:45,018 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:59:45,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:59:45,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:59:45,019 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:59:45,019 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:59:45,032 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143 places, 181 transitions [2019-11-15 23:59:47,714 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-11-15 23:59:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-11-15 23:59:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:59:47,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:47,730 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] [2019-11-15 23:59:47,733 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1224986376, now seen corresponding path program 1 times [2019-11-15 23:59:47,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:47,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449277309] [2019-11-15 23:59:47,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:47,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:47,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:48,010 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-15 23:59:48,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449277309] [2019-11-15 23:59:48,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:48,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:59:48,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961317038] [2019-11-15 23:59:48,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:48,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:48,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:48,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:59:48,032 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-11-15 23:59:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:48,753 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-11-15 23:59:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:59:48,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:59:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:49,025 INFO L225 Difference]: With dead ends: 33593 [2019-11-15 23:59:49,026 INFO L226 Difference]: Without dead ends: 25705 [2019-11-15 23:59:49,027 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-15 23:59:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-11-15 23:59:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-11-15 23:59:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-11-15 23:59:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-11-15 23:59:50,599 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-11-15 23:59:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:50,600 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-11-15 23:59:50,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-11-15 23:59:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:59:50,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:50,616 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] [2019-11-15 23:59:50,617 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -739593163, now seen corresponding path program 1 times [2019-11-15 23:59:50,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:50,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059988556] [2019-11-15 23:59:50,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:50,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:50,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:50,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-15 23:59:50,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059988556] [2019-11-15 23:59:50,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:50,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:50,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362371732] [2019-11-15 23:59:50,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:59:50,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:50,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:50,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:50,787 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-11-15 23:59:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:51,866 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-11-15 23:59:51,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:51,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 23:59:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:52,037 INFO L225 Difference]: With dead ends: 41083 [2019-11-15 23:59:52,038 INFO L226 Difference]: Without dead ends: 40547 [2019-11-15 23:59:52,039 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-15 23:59:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-11-15 23:59:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-11-15 23:59:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-11-15 23:59:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-11-15 23:59:53,513 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-11-15 23:59:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:53,515 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-11-15 23:59:53,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:59:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-11-15 23:59:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:59:53,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:53,522 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-15 23:59:53,522 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:53,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:53,523 INFO L82 PathProgramCache]: Analyzing trace with hash 919931139, now seen corresponding path program 1 times [2019-11-15 23:59:53,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:53,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430671361] [2019-11-15 23:59:53,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:53,632 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-15 23:59:53,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430671361] [2019-11-15 23:59:53,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:53,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:53,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202380150] [2019-11-15 23:59:53,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:59:53,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:53,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:53,634 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-11-15 23:59:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:54,246 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-11-15 23:59:54,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:54,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-15 23:59:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:54,560 INFO L225 Difference]: With dead ends: 49780 [2019-11-15 23:59:54,560 INFO L226 Difference]: Without dead ends: 49276 [2019-11-15 23:59:54,561 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-15 23:59:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-11-15 23:59:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-11-15 23:59:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-11-15 23:59:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-11-15 23:59:56,207 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-11-15 23:59:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:56,208 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-11-15 23:59:56,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:59:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-11-15 23:59:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:59:56,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:56,218 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] [2019-11-15 23:59:56,218 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash 261792169, now seen corresponding path program 1 times [2019-11-15 23:59:56,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:56,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534870104] [2019-11-15 23:59:56,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:56,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:56,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:56,259 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-15 23:59:56,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534870104] [2019-11-15 23:59:56,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:56,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:56,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357904536] [2019-11-15 23:59:56,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:59:56,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:56,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:56,262 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-11-15 23:59:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:56,600 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-11-15 23:59:56,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:56,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-15 23:59:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:56,761 INFO L225 Difference]: With dead ends: 61089 [2019-11-15 23:59:56,761 INFO L226 Difference]: Without dead ends: 61089 [2019-11-15 23:59:56,763 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-15 23:59:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-11-15 23:59:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-11-15 23:59:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-11-15 23:59:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-11-15 23:59:58,428 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-11-15 23:59:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:58,428 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-11-15 23:59:58,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:59:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-11-15 23:59:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:59:58,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:58,446 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] [2019-11-15 23:59:58,446 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1705100553, now seen corresponding path program 1 times [2019-11-15 23:59:58,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:58,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698319727] [2019-11-15 23:59:58,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:58,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:58,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:58,588 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-15 23:59:58,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698319727] [2019-11-15 23:59:58,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:58,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:58,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433500929] [2019-11-15 23:59:58,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:58,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:58,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:58,590 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 6 states. [2019-11-15 23:59:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:59,468 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-11-15 23:59:59,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:59,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-15 23:59:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:59,646 INFO L225 Difference]: With dead ends: 63758 [2019-11-15 23:59:59,646 INFO L226 Difference]: Without dead ends: 63758 [2019-11-15 23:59:59,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:59:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-11-16 00:00:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-11-16 00:00:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-11-16 00:00:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-11-16 00:00:01,753 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-11-16 00:00:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:01,753 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-11-16 00:00:01,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-11-16 00:00:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:00:01,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:01,773 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] [2019-11-16 00:00:01,773 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash 792915384, now seen corresponding path program 1 times [2019-11-16 00:00:01,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:01,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319547766] [2019-11-16 00:00:01,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:01,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:01,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:01,874 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:00:01,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319547766] [2019-11-16 00:00:01,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:01,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:00:01,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376946056] [2019-11-16 00:00:01,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:00:01,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:00:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:01,876 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 7 states. [2019-11-16 00:00:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:03,078 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-11-16 00:00:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:00:03,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-16 00:00:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:03,242 INFO L225 Difference]: With dead ends: 83687 [2019-11-16 00:00:03,242 INFO L226 Difference]: Without dead ends: 83687 [2019-11-16 00:00:03,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:00:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-11-16 00:00:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-11-16 00:00:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-11-16 00:00:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-11-16 00:00:08,529 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-11-16 00:00:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:08,530 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-11-16 00:00:08,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:00:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-11-16 00:00:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:00:08,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:08,548 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] [2019-11-16 00:00:08,548 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:08,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1680419065, now seen corresponding path program 1 times [2019-11-16 00:00:08,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:08,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706008628] [2019-11-16 00:00:08,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:08,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:08,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:08,600 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:00:08,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706008628] [2019-11-16 00:00:08,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:08,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:00:08,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343952061] [2019-11-16 00:00:08,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:00:08,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:00:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:00:08,602 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 3 states. [2019-11-16 00:00:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:08,849 INFO L93 Difference]: Finished difference Result 54023 states and 188920 transitions. [2019-11-16 00:00:08,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:00:08,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-16 00:00:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:08,964 INFO L225 Difference]: With dead ends: 54023 [2019-11-16 00:00:08,965 INFO L226 Difference]: Without dead ends: 54023 [2019-11-16 00:00:08,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:00:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54023 states. [2019-11-16 00:00:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54023 to 53408. [2019-11-16 00:00:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53408 states. [2019-11-16 00:00:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53408 states to 53408 states and 187039 transitions. [2019-11-16 00:00:09,961 INFO L78 Accepts]: Start accepts. Automaton has 53408 states and 187039 transitions. Word has length 55 [2019-11-16 00:00:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:09,961 INFO L462 AbstractCegarLoop]: Abstraction has 53408 states and 187039 transitions. [2019-11-16 00:00:09,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:00:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 53408 states and 187039 transitions. [2019-11-16 00:00:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:00:09,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:09,970 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] [2019-11-16 00:00:09,971 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash 200257268, now seen corresponding path program 1 times [2019-11-16 00:00:09,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:09,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007903724] [2019-11-16 00:00:09,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:09,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:09,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:10,670 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:00:10,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007903724] [2019-11-16 00:00:10,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:10,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:10,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268072652] [2019-11-16 00:00:10,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:10,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:10,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:10,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:10,672 INFO L87 Difference]: Start difference. First operand 53408 states and 187039 transitions. Second operand 6 states. [2019-11-16 00:00:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:11,444 INFO L93 Difference]: Finished difference Result 68648 states and 237303 transitions. [2019-11-16 00:00:11,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:00:11,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-16 00:00:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:11,589 INFO L225 Difference]: With dead ends: 68648 [2019-11-16 00:00:11,590 INFO L226 Difference]: Without dead ends: 68080 [2019-11-16 00:00:11,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:00:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68080 states. [2019-11-16 00:00:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68080 to 53492. [2019-11-16 00:00:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53492 states. [2019-11-16 00:00:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53492 states to 53492 states and 187736 transitions. [2019-11-16 00:00:12,689 INFO L78 Accepts]: Start accepts. Automaton has 53492 states and 187736 transitions. Word has length 55 [2019-11-16 00:00:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:12,689 INFO L462 AbstractCegarLoop]: Abstraction has 53492 states and 187736 transitions. [2019-11-16 00:00:12,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 53492 states and 187736 transitions. [2019-11-16 00:00:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:00:12,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:12,701 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:00:12,702 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1664563738, now seen corresponding path program 1 times [2019-11-16 00:00:12,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:12,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812430798] [2019-11-16 00:00:12,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:12,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:12,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:12,835 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:00:12,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812430798] [2019-11-16 00:00:12,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:12,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:12,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173782989] [2019-11-16 00:00:12,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:12,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:12,840 INFO L87 Difference]: Start difference. First operand 53492 states and 187736 transitions. Second operand 5 states. [2019-11-16 00:00:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:13,289 INFO L93 Difference]: Finished difference Result 53612 states and 187580 transitions. [2019-11-16 00:00:13,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:00:13,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-16 00:00:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:13,401 INFO L225 Difference]: With dead ends: 53612 [2019-11-16 00:00:13,401 INFO L226 Difference]: Without dead ends: 53612 [2019-11-16 00:00:13,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53612 states. [2019-11-16 00:00:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53612 to 53525. [2019-11-16 00:00:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53525 states. [2019-11-16 00:00:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53525 states to 53525 states and 187310 transitions. [2019-11-16 00:00:15,056 INFO L78 Accepts]: Start accepts. Automaton has 53525 states and 187310 transitions. Word has length 56 [2019-11-16 00:00:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:15,056 INFO L462 AbstractCegarLoop]: Abstraction has 53525 states and 187310 transitions. [2019-11-16 00:00:15,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 53525 states and 187310 transitions. [2019-11-16 00:00:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:00:15,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:15,067 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:00:15,067 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash -777060057, now seen corresponding path program 1 times [2019-11-16 00:00:15,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:15,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127035768] [2019-11-16 00:00:15,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:15,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:15,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:15,135 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:00:15,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127035768] [2019-11-16 00:00:15,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:15,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:00:15,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853341920] [2019-11-16 00:00:15,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:00:15,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:15,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:00:15,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:00:15,136 INFO L87 Difference]: Start difference. First operand 53525 states and 187310 transitions. Second operand 4 states. [2019-11-16 00:00:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:15,188 INFO L93 Difference]: Finished difference Result 10214 states and 31230 transitions. [2019-11-16 00:00:15,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:00:15,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-16 00:00:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:15,199 INFO L225 Difference]: With dead ends: 10214 [2019-11-16 00:00:15,199 INFO L226 Difference]: Without dead ends: 8509 [2019-11-16 00:00:15,200 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:00:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8509 states. [2019-11-16 00:00:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8509 to 8461. [2019-11-16 00:00:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-16 00:00:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 25309 transitions. [2019-11-16 00:00:15,303 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 25309 transitions. Word has length 56 [2019-11-16 00:00:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:15,303 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 25309 transitions. [2019-11-16 00:00:15,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:00:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 25309 transitions. [2019-11-16 00:00:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:00:15,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:15,306 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] [2019-11-16 00:00:15,306 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1281020880, now seen corresponding path program 1 times [2019-11-16 00:00:15,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:15,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89188610] [2019-11-16 00:00:15,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:15,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:15,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:15,349 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:00:15,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89188610] [2019-11-16 00:00:15,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:15,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:00:15,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080766562] [2019-11-16 00:00:15,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:00:15,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:15,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:00:15,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:00:15,350 INFO L87 Difference]: Start difference. First operand 8461 states and 25309 transitions. Second operand 4 states. [2019-11-16 00:00:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:15,478 INFO L93 Difference]: Finished difference Result 9708 states and 29088 transitions. [2019-11-16 00:00:15,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:00:15,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-16 00:00:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:15,492 INFO L225 Difference]: With dead ends: 9708 [2019-11-16 00:00:15,492 INFO L226 Difference]: Without dead ends: 9708 [2019-11-16 00:00:15,492 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:00:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9708 states. [2019-11-16 00:00:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9708 to 8881. [2019-11-16 00:00:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8881 states. [2019-11-16 00:00:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8881 states to 8881 states and 26572 transitions. [2019-11-16 00:00:15,617 INFO L78 Accepts]: Start accepts. Automaton has 8881 states and 26572 transitions. Word has length 63 [2019-11-16 00:00:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:15,617 INFO L462 AbstractCegarLoop]: Abstraction has 8881 states and 26572 transitions. [2019-11-16 00:00:15,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:00:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8881 states and 26572 transitions. [2019-11-16 00:00:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:00:15,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:15,620 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] [2019-11-16 00:00:15,621 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1271136081, now seen corresponding path program 1 times [2019-11-16 00:00:15,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:15,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001658906] [2019-11-16 00:00:15,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:15,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:15,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:15,712 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:00:15,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001658906] [2019-11-16 00:00:15,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:15,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:15,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248943213] [2019-11-16 00:00:15,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:15,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:15,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:15,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:15,713 INFO L87 Difference]: Start difference. First operand 8881 states and 26572 transitions. Second operand 6 states. [2019-11-16 00:00:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:16,094 INFO L93 Difference]: Finished difference Result 11197 states and 33041 transitions. [2019-11-16 00:00:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:00:16,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-16 00:00:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:16,108 INFO L225 Difference]: With dead ends: 11197 [2019-11-16 00:00:16,108 INFO L226 Difference]: Without dead ends: 11136 [2019-11-16 00:00:16,108 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:00:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11136 states. [2019-11-16 00:00:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11136 to 10412. [2019-11-16 00:00:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10412 states. [2019-11-16 00:00:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10412 states to 10412 states and 30917 transitions. [2019-11-16 00:00:16,241 INFO L78 Accepts]: Start accepts. Automaton has 10412 states and 30917 transitions. Word has length 63 [2019-11-16 00:00:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:16,242 INFO L462 AbstractCegarLoop]: Abstraction has 10412 states and 30917 transitions. [2019-11-16 00:00:16,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 10412 states and 30917 transitions. [2019-11-16 00:00:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:16,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:16,247 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] [2019-11-16 00:00:16,247 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:16,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:16,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1194893593, now seen corresponding path program 1 times [2019-11-16 00:00:16,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:16,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890758099] [2019-11-16 00:00:16,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:16,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:16,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:16,285 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:00:16,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890758099] [2019-11-16 00:00:16,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:16,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:00:16,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005232312] [2019-11-16 00:00:16,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:00:16,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:00:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:00:16,287 INFO L87 Difference]: Start difference. First operand 10412 states and 30917 transitions. Second operand 3 states. [2019-11-16 00:00:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:16,496 INFO L93 Difference]: Finished difference Result 10964 states and 32321 transitions. [2019-11-16 00:00:16,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:00:16,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-16 00:00:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:16,509 INFO L225 Difference]: With dead ends: 10964 [2019-11-16 00:00:16,509 INFO L226 Difference]: Without dead ends: 10964 [2019-11-16 00:00:16,509 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:00:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2019-11-16 00:00:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 10688. [2019-11-16 00:00:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10688 states. [2019-11-16 00:00:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10688 states to 10688 states and 31619 transitions. [2019-11-16 00:00:16,638 INFO L78 Accepts]: Start accepts. Automaton has 10688 states and 31619 transitions. Word has length 69 [2019-11-16 00:00:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:16,638 INFO L462 AbstractCegarLoop]: Abstraction has 10688 states and 31619 transitions. [2019-11-16 00:00:16,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:00:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 10688 states and 31619 transitions. [2019-11-16 00:00:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:16,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:16,644 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] [2019-11-16 00:00:16,644 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash 233279576, now seen corresponding path program 1 times [2019-11-16 00:00:16,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:16,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756788570] [2019-11-16 00:00:16,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:16,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:16,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:16,698 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:00:16,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756788570] [2019-11-16 00:00:16,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:16,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:00:16,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714240189] [2019-11-16 00:00:16,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:00:16,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:16,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:00:16,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:00:16,700 INFO L87 Difference]: Start difference. First operand 10688 states and 31619 transitions. Second operand 4 states. [2019-11-16 00:00:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:17,019 INFO L93 Difference]: Finished difference Result 13661 states and 40010 transitions. [2019-11-16 00:00:17,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:00:17,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-16 00:00:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:17,042 INFO L225 Difference]: With dead ends: 13661 [2019-11-16 00:00:17,042 INFO L226 Difference]: Without dead ends: 13661 [2019-11-16 00:00:17,044 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:00:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13661 states. [2019-11-16 00:00:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13661 to 12002. [2019-11-16 00:00:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12002 states. [2019-11-16 00:00:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 35254 transitions. [2019-11-16 00:00:17,221 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 35254 transitions. Word has length 69 [2019-11-16 00:00:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:17,222 INFO L462 AbstractCegarLoop]: Abstraction has 12002 states and 35254 transitions. [2019-11-16 00:00:17,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:00:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 35254 transitions. [2019-11-16 00:00:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:17,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:17,229 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] [2019-11-16 00:00:17,229 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:17,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:17,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1478044057, now seen corresponding path program 1 times [2019-11-16 00:00:17,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:17,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291833892] [2019-11-16 00:00:17,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:17,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:17,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:17,349 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:00:17,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291833892] [2019-11-16 00:00:17,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:17,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:17,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751564747] [2019-11-16 00:00:17,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:17,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:17,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:17,351 INFO L87 Difference]: Start difference. First operand 12002 states and 35254 transitions. Second operand 6 states. [2019-11-16 00:00:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:17,962 INFO L93 Difference]: Finished difference Result 12981 states and 37563 transitions. [2019-11-16 00:00:17,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:00:17,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-16 00:00:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:17,984 INFO L225 Difference]: With dead ends: 12981 [2019-11-16 00:00:17,984 INFO L226 Difference]: Without dead ends: 12981 [2019-11-16 00:00:17,986 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:00:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2019-11-16 00:00:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12575. [2019-11-16 00:00:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12575 states. [2019-11-16 00:00:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12575 states to 12575 states and 36551 transitions. [2019-11-16 00:00:18,158 INFO L78 Accepts]: Start accepts. Automaton has 12575 states and 36551 transitions. Word has length 69 [2019-11-16 00:00:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:18,158 INFO L462 AbstractCegarLoop]: Abstraction has 12575 states and 36551 transitions. [2019-11-16 00:00:18,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12575 states and 36551 transitions. [2019-11-16 00:00:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:18,166 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:18,166 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] [2019-11-16 00:00:18,166 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash -599165286, now seen corresponding path program 1 times [2019-11-16 00:00:18,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:18,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680576221] [2019-11-16 00:00:18,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:18,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:18,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:18,284 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:00:18,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680576221] [2019-11-16 00:00:18,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:18,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:18,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204248074] [2019-11-16 00:00:18,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:18,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:18,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:18,286 INFO L87 Difference]: Start difference. First operand 12575 states and 36551 transitions. Second operand 6 states. [2019-11-16 00:00:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:18,684 INFO L93 Difference]: Finished difference Result 14464 states and 40799 transitions. [2019-11-16 00:00:18,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:00:18,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-16 00:00:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:18,701 INFO L225 Difference]: With dead ends: 14464 [2019-11-16 00:00:18,701 INFO L226 Difference]: Without dead ends: 14464 [2019-11-16 00:00:18,702 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:00:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14464 states. [2019-11-16 00:00:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14464 to 13138. [2019-11-16 00:00:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13138 states. [2019-11-16 00:00:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13138 states to 13138 states and 37520 transitions. [2019-11-16 00:00:18,861 INFO L78 Accepts]: Start accepts. Automaton has 13138 states and 37520 transitions. Word has length 69 [2019-11-16 00:00:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:18,861 INFO L462 AbstractCegarLoop]: Abstraction has 13138 states and 37520 transitions. [2019-11-16 00:00:18,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 13138 states and 37520 transitions. [2019-11-16 00:00:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:18,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:18,869 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] [2019-11-16 00:00:18,869 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash -387814373, now seen corresponding path program 1 times [2019-11-16 00:00:18,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:18,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595927465] [2019-11-16 00:00:18,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:18,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:18,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:18,933 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:00:18,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595927465] [2019-11-16 00:00:18,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:18,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:18,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785098774] [2019-11-16 00:00:18,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:18,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:18,935 INFO L87 Difference]: Start difference. First operand 13138 states and 37520 transitions. Second operand 5 states. [2019-11-16 00:00:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:19,237 INFO L93 Difference]: Finished difference Result 16964 states and 48232 transitions. [2019-11-16 00:00:19,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:00:19,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-16 00:00:19,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:19,257 INFO L225 Difference]: With dead ends: 16964 [2019-11-16 00:00:19,257 INFO L226 Difference]: Without dead ends: 16964 [2019-11-16 00:00:19,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16964 states. [2019-11-16 00:00:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16964 to 15668. [2019-11-16 00:00:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15668 states. [2019-11-16 00:00:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 44417 transitions. [2019-11-16 00:00:19,455 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 44417 transitions. Word has length 69 [2019-11-16 00:00:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:19,456 INFO L462 AbstractCegarLoop]: Abstraction has 15668 states and 44417 transitions. [2019-11-16 00:00:19,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 44417 transitions. [2019-11-16 00:00:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:19,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:19,463 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] [2019-11-16 00:00:19,463 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:19,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash -898348550, now seen corresponding path program 1 times [2019-11-16 00:00:19,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:19,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061034329] [2019-11-16 00:00:19,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:19,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:19,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:19,524 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:00:19,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061034329] [2019-11-16 00:00:19,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:19,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:00:19,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179509650] [2019-11-16 00:00:19,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:00:19,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:19,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:00:19,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:00:19,529 INFO L87 Difference]: Start difference. First operand 15668 states and 44417 transitions. Second operand 4 states. [2019-11-16 00:00:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:19,985 INFO L93 Difference]: Finished difference Result 19238 states and 54717 transitions. [2019-11-16 00:00:19,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:00:19,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-16 00:00:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:20,013 INFO L225 Difference]: With dead ends: 19238 [2019-11-16 00:00:20,013 INFO L226 Difference]: Without dead ends: 19061 [2019-11-16 00:00:20,013 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:00:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19061 states. [2019-11-16 00:00:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19061 to 18191. [2019-11-16 00:00:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18191 states. [2019-11-16 00:00:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18191 states to 18191 states and 51631 transitions. [2019-11-16 00:00:20,325 INFO L78 Accepts]: Start accepts. Automaton has 18191 states and 51631 transitions. Word has length 69 [2019-11-16 00:00:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:20,326 INFO L462 AbstractCegarLoop]: Abstraction has 18191 states and 51631 transitions. [2019-11-16 00:00:20,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:00:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 18191 states and 51631 transitions. [2019-11-16 00:00:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:20,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:20,335 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] [2019-11-16 00:00:20,335 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:20,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1599667387, now seen corresponding path program 1 times [2019-11-16 00:00:20,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:20,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457311597] [2019-11-16 00:00:20,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:20,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:20,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:20,468 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:00:20,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457311597] [2019-11-16 00:00:20,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:20,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:00:20,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72249580] [2019-11-16 00:00:20,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:00:20,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:20,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:00:20,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:20,470 INFO L87 Difference]: Start difference. First operand 18191 states and 51631 transitions. Second operand 7 states. [2019-11-16 00:00:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:21,051 INFO L93 Difference]: Finished difference Result 21800 states and 60753 transitions. [2019-11-16 00:00:21,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:00:21,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-16 00:00:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:21,076 INFO L225 Difference]: With dead ends: 21800 [2019-11-16 00:00:21,076 INFO L226 Difference]: Without dead ends: 21800 [2019-11-16 00:00:21,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:00:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21800 states. [2019-11-16 00:00:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21800 to 18367. [2019-11-16 00:00:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18367 states. [2019-11-16 00:00:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18367 states to 18367 states and 51123 transitions. [2019-11-16 00:00:21,301 INFO L78 Accepts]: Start accepts. Automaton has 18367 states and 51123 transitions. Word has length 69 [2019-11-16 00:00:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:21,301 INFO L462 AbstractCegarLoop]: Abstraction has 18367 states and 51123 transitions. [2019-11-16 00:00:21,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:00:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 18367 states and 51123 transitions. [2019-11-16 00:00:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:21,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:21,308 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] [2019-11-16 00:00:21,308 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1807796228, now seen corresponding path program 1 times [2019-11-16 00:00:21,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:21,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314476123] [2019-11-16 00:00:21,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:21,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:21,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:21,383 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:00:21,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314476123] [2019-11-16 00:00:21,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:21,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:21,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167590200] [2019-11-16 00:00:21,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:21,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:21,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:21,384 INFO L87 Difference]: Start difference. First operand 18367 states and 51123 transitions. Second operand 5 states. [2019-11-16 00:00:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:21,453 INFO L93 Difference]: Finished difference Result 6133 states and 14464 transitions. [2019-11-16 00:00:21,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:00:21,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-16 00:00:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:21,459 INFO L225 Difference]: With dead ends: 6133 [2019-11-16 00:00:21,459 INFO L226 Difference]: Without dead ends: 5263 [2019-11-16 00:00:21,460 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:00:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-11-16 00:00:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4728. [2019-11-16 00:00:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4728 states. [2019-11-16 00:00:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 10823 transitions. [2019-11-16 00:00:21,519 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 10823 transitions. Word has length 69 [2019-11-16 00:00:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:21,520 INFO L462 AbstractCegarLoop]: Abstraction has 4728 states and 10823 transitions. [2019-11-16 00:00:21,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 10823 transitions. [2019-11-16 00:00:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:00:21,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:21,523 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] [2019-11-16 00:00:21,523 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1763644192, now seen corresponding path program 1 times [2019-11-16 00:00:21,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:21,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095450767] [2019-11-16 00:00:21,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:21,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:21,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:21,555 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:00:21,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095450767] [2019-11-16 00:00:21,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:21,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:00:21,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499307599] [2019-11-16 00:00:21,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:00:21,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:00:21,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:00:21,560 INFO L87 Difference]: Start difference. First operand 4728 states and 10823 transitions. Second operand 3 states. [2019-11-16 00:00:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:21,597 INFO L93 Difference]: Finished difference Result 5858 states and 13189 transitions. [2019-11-16 00:00:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:00:21,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-16 00:00:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:21,604 INFO L225 Difference]: With dead ends: 5858 [2019-11-16 00:00:21,604 INFO L226 Difference]: Without dead ends: 5858 [2019-11-16 00:00:21,607 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:00:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-11-16 00:00:21,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4663. [2019-11-16 00:00:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-11-16 00:00:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10385 transitions. [2019-11-16 00:00:21,669 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10385 transitions. Word has length 69 [2019-11-16 00:00:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:21,670 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10385 transitions. [2019-11-16 00:00:21,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:00:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10385 transitions. [2019-11-16 00:00:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:00:21,673 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:21,673 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] [2019-11-16 00:00:21,674 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:21,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1221048589, now seen corresponding path program 1 times [2019-11-16 00:00:21,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:21,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355122982] [2019-11-16 00:00:21,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:21,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:21,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:21,754 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:00:21,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355122982] [2019-11-16 00:00:21,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:21,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:21,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365564266] [2019-11-16 00:00:21,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:21,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:21,755 INFO L87 Difference]: Start difference. First operand 4663 states and 10385 transitions. Second operand 5 states. [2019-11-16 00:00:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:21,951 INFO L93 Difference]: Finished difference Result 5724 states and 12814 transitions. [2019-11-16 00:00:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:00:21,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-16 00:00:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:21,958 INFO L225 Difference]: With dead ends: 5724 [2019-11-16 00:00:21,958 INFO L226 Difference]: Without dead ends: 5724 [2019-11-16 00:00:21,959 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:00:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-11-16 00:00:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5083. [2019-11-16 00:00:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-11-16 00:00:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 11343 transitions. [2019-11-16 00:00:22,025 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 11343 transitions. Word has length 75 [2019-11-16 00:00:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:22,025 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 11343 transitions. [2019-11-16 00:00:22,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 11343 transitions. [2019-11-16 00:00:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:00:22,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:22,031 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] [2019-11-16 00:00:22,031 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash 521761746, now seen corresponding path program 1 times [2019-11-16 00:00:22,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:22,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987734260] [2019-11-16 00:00:22,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:22,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:22,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:22,117 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:00:22,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987734260] [2019-11-16 00:00:22,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:22,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:00:22,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258172746] [2019-11-16 00:00:22,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:00:22,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:00:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:22,121 INFO L87 Difference]: Start difference. First operand 5083 states and 11343 transitions. Second operand 7 states. [2019-11-16 00:00:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:22,609 INFO L93 Difference]: Finished difference Result 5823 states and 12866 transitions. [2019-11-16 00:00:22,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:00:22,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-11-16 00:00:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:22,616 INFO L225 Difference]: With dead ends: 5823 [2019-11-16 00:00:22,616 INFO L226 Difference]: Without dead ends: 5770 [2019-11-16 00:00:22,616 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:00:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-11-16 00:00:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5170. [2019-11-16 00:00:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-11-16 00:00:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 11432 transitions. [2019-11-16 00:00:22,684 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 11432 transitions. Word has length 75 [2019-11-16 00:00:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:22,685 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 11432 transitions. [2019-11-16 00:00:22,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:00:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 11432 transitions. [2019-11-16 00:00:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:00:22,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:22,691 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] [2019-11-16 00:00:22,691 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:22,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:22,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1512586684, now seen corresponding path program 1 times [2019-11-16 00:00:22,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:22,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099934072] [2019-11-16 00:00:22,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:22,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:22,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:22,778 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:00:22,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099934072] [2019-11-16 00:00:22,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:22,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:22,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247421985] [2019-11-16 00:00:22,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:22,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:22,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:22,781 INFO L87 Difference]: Start difference. First operand 5170 states and 11432 transitions. Second operand 5 states. [2019-11-16 00:00:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:23,100 INFO L93 Difference]: Finished difference Result 4679 states and 10281 transitions. [2019-11-16 00:00:23,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:00:23,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-16 00:00:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:23,105 INFO L225 Difference]: With dead ends: 4679 [2019-11-16 00:00:23,105 INFO L226 Difference]: Without dead ends: 4679 [2019-11-16 00:00:23,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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:00:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2019-11-16 00:00:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4257. [2019-11-16 00:00:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4257 states. [2019-11-16 00:00:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 9317 transitions. [2019-11-16 00:00:23,147 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 9317 transitions. Word has length 96 [2019-11-16 00:00:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:23,147 INFO L462 AbstractCegarLoop]: Abstraction has 4257 states and 9317 transitions. [2019-11-16 00:00:23,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 9317 transitions. [2019-11-16 00:00:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:00:23,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:23,152 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:23,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:23,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1420742303, now seen corresponding path program 1 times [2019-11-16 00:00:23,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:23,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240984986] [2019-11-16 00:00:23,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:23,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:23,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:23,213 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:00:23,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240984986] [2019-11-16 00:00:23,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:23,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:00:23,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646617366] [2019-11-16 00:00:23,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:00:23,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:00:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:00:23,215 INFO L87 Difference]: Start difference. First operand 4257 states and 9317 transitions. Second operand 4 states. [2019-11-16 00:00:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:23,290 INFO L93 Difference]: Finished difference Result 5241 states and 11450 transitions. [2019-11-16 00:00:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:00:23,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:00:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:23,295 INFO L225 Difference]: With dead ends: 5241 [2019-11-16 00:00:23,295 INFO L226 Difference]: Without dead ends: 5241 [2019-11-16 00:00:23,295 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:00:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5241 states. [2019-11-16 00:00:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5241 to 4568. [2019-11-16 00:00:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4568 states. [2019-11-16 00:00:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4568 states to 4568 states and 10013 transitions. [2019-11-16 00:00:23,338 INFO L78 Accepts]: Start accepts. Automaton has 4568 states and 10013 transitions. Word has length 96 [2019-11-16 00:00:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:23,338 INFO L462 AbstractCegarLoop]: Abstraction has 4568 states and 10013 transitions. [2019-11-16 00:00:23,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:00:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4568 states and 10013 transitions. [2019-11-16 00:00:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:23,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:23,342 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] [2019-11-16 00:00:23,343 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1749984676, now seen corresponding path program 1 times [2019-11-16 00:00:23,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:23,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204827101] [2019-11-16 00:00:23,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:23,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:23,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:23,418 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:00:23,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204827101] [2019-11-16 00:00:23,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:23,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:23,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070594822] [2019-11-16 00:00:23,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:23,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:23,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:23,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:23,421 INFO L87 Difference]: Start difference. First operand 4568 states and 10013 transitions. Second operand 5 states. [2019-11-16 00:00:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:23,524 INFO L93 Difference]: Finished difference Result 5253 states and 11535 transitions. [2019-11-16 00:00:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:00:23,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-16 00:00:23,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:23,528 INFO L225 Difference]: With dead ends: 5253 [2019-11-16 00:00:23,528 INFO L226 Difference]: Without dead ends: 5253 [2019-11-16 00:00:23,528 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:00:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2019-11-16 00:00:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4124. [2019-11-16 00:00:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2019-11-16 00:00:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 9024 transitions. [2019-11-16 00:00:23,569 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 9024 transitions. Word has length 98 [2019-11-16 00:00:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:23,569 INFO L462 AbstractCegarLoop]: Abstraction has 4124 states and 9024 transitions. [2019-11-16 00:00:23,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 9024 transitions. [2019-11-16 00:00:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:23,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:23,574 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] [2019-11-16 00:00:23,575 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash -912178621, now seen corresponding path program 1 times [2019-11-16 00:00:23,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:23,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843074307] [2019-11-16 00:00:23,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:23,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:23,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:23,726 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:00:23,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843074307] [2019-11-16 00:00:23,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:23,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:00:23,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110033385] [2019-11-16 00:00:23,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:00:23,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:00:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:23,727 INFO L87 Difference]: Start difference. First operand 4124 states and 9024 transitions. Second operand 7 states. [2019-11-16 00:00:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:23,988 INFO L93 Difference]: Finished difference Result 5493 states and 11957 transitions. [2019-11-16 00:00:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:00:23,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-11-16 00:00:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:23,992 INFO L225 Difference]: With dead ends: 5493 [2019-11-16 00:00:23,992 INFO L226 Difference]: Without dead ends: 5447 [2019-11-16 00:00:23,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:00:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2019-11-16 00:00:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 4537. [2019-11-16 00:00:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-11-16 00:00:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 9883 transitions. [2019-11-16 00:00:24,039 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 9883 transitions. Word has length 98 [2019-11-16 00:00:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:24,040 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 9883 transitions. [2019-11-16 00:00:24,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:00:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 9883 transitions. [2019-11-16 00:00:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:24,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:24,043 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] [2019-11-16 00:00:24,043 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1166915166, now seen corresponding path program 1 times [2019-11-16 00:00:24,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:24,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568619067] [2019-11-16 00:00:24,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:24,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:24,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:24,138 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:00:24,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568619067] [2019-11-16 00:00:24,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:24,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:24,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740283228] [2019-11-16 00:00:24,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:24,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:24,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:24,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:24,140 INFO L87 Difference]: Start difference. First operand 4537 states and 9883 transitions. Second operand 6 states. [2019-11-16 00:00:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:24,504 INFO L93 Difference]: Finished difference Result 5078 states and 11081 transitions. [2019-11-16 00:00:24,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:00:24,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-16 00:00:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:24,510 INFO L225 Difference]: With dead ends: 5078 [2019-11-16 00:00:24,510 INFO L226 Difference]: Without dead ends: 5078 [2019-11-16 00:00:24,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:00:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-11-16 00:00:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 4753. [2019-11-16 00:00:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4753 states. [2019-11-16 00:00:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 10359 transitions. [2019-11-16 00:00:24,571 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 10359 transitions. Word has length 98 [2019-11-16 00:00:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:24,572 INFO L462 AbstractCegarLoop]: Abstraction has 4753 states and 10359 transitions. [2019-11-16 00:00:24,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 10359 transitions. [2019-11-16 00:00:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:24,577 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:24,577 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] [2019-11-16 00:00:24,578 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:24,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash 278839715, now seen corresponding path program 1 times [2019-11-16 00:00:24,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:24,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181313003] [2019-11-16 00:00:24,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:24,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:24,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:24,677 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:00:24,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181313003] [2019-11-16 00:00:24,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:24,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:24,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729505701] [2019-11-16 00:00:24,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:24,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:24,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:24,679 INFO L87 Difference]: Start difference. First operand 4753 states and 10359 transitions. Second operand 6 states. [2019-11-16 00:00:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:25,229 INFO L93 Difference]: Finished difference Result 6469 states and 13998 transitions. [2019-11-16 00:00:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:00:25,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-16 00:00:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:25,235 INFO L225 Difference]: With dead ends: 6469 [2019-11-16 00:00:25,235 INFO L226 Difference]: Without dead ends: 6455 [2019-11-16 00:00:25,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:00:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2019-11-16 00:00:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 5136. [2019-11-16 00:00:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5136 states. [2019-11-16 00:00:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5136 states to 5136 states and 11302 transitions. [2019-11-16 00:00:25,287 INFO L78 Accepts]: Start accepts. Automaton has 5136 states and 11302 transitions. Word has length 98 [2019-11-16 00:00:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:25,287 INFO L462 AbstractCegarLoop]: Abstraction has 5136 states and 11302 transitions. [2019-11-16 00:00:25,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5136 states and 11302 transitions. [2019-11-16 00:00:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:25,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:25,291 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] [2019-11-16 00:00:25,291 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash 490190628, now seen corresponding path program 1 times [2019-11-16 00:00:25,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:25,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800304903] [2019-11-16 00:00:25,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:25,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:25,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:25,405 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:00:25,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800304903] [2019-11-16 00:00:25,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:25,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:25,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086582564] [2019-11-16 00:00:25,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:25,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:25,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:25,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:25,407 INFO L87 Difference]: Start difference. First operand 5136 states and 11302 transitions. Second operand 6 states. [2019-11-16 00:00:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:25,636 INFO L93 Difference]: Finished difference Result 5447 states and 11744 transitions. [2019-11-16 00:00:25,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:00:25,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-16 00:00:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:25,642 INFO L225 Difference]: With dead ends: 5447 [2019-11-16 00:00:25,642 INFO L226 Difference]: Without dead ends: 5407 [2019-11-16 00:00:25,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2019-11-16 00:00:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 4742. [2019-11-16 00:00:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4742 states. [2019-11-16 00:00:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4742 states to 4742 states and 10299 transitions. [2019-11-16 00:00:25,709 INFO L78 Accepts]: Start accepts. Automaton has 4742 states and 10299 transitions. Word has length 98 [2019-11-16 00:00:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:25,709 INFO L462 AbstractCegarLoop]: Abstraction has 4742 states and 10299 transitions. [2019-11-16 00:00:25,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 10299 transitions. [2019-11-16 00:00:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:25,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:25,716 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] [2019-11-16 00:00:25,716 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 971941412, now seen corresponding path program 1 times [2019-11-16 00:00:25,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:25,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007621878] [2019-11-16 00:00:25,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:25,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:26,020 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:00:26,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007621878] [2019-11-16 00:00:26,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:26,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:00:26,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032468690] [2019-11-16 00:00:26,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:00:26,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:26,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:00:26,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:00:26,023 INFO L87 Difference]: Start difference. First operand 4742 states and 10299 transitions. Second operand 11 states. [2019-11-16 00:00:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:26,812 INFO L93 Difference]: Finished difference Result 5466 states and 11852 transitions. [2019-11-16 00:00:26,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:00:26,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-11-16 00:00:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:26,816 INFO L225 Difference]: With dead ends: 5466 [2019-11-16 00:00:26,817 INFO L226 Difference]: Without dead ends: 5466 [2019-11-16 00:00:26,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:00:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-11-16 00:00:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 4905. [2019-11-16 00:00:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4905 states. [2019-11-16 00:00:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 10657 transitions. [2019-11-16 00:00:26,862 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 10657 transitions. Word has length 98 [2019-11-16 00:00:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:26,863 INFO L462 AbstractCegarLoop]: Abstraction has 4905 states and 10657 transitions. [2019-11-16 00:00:26,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:00:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 10657 transitions. [2019-11-16 00:00:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:26,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:26,867 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] [2019-11-16 00:00:26,867 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:26,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:26,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2084314939, now seen corresponding path program 1 times [2019-11-16 00:00:26,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:26,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139301722] [2019-11-16 00:00:26,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:26,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:26,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:26,978 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:00:26,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139301722] [2019-11-16 00:00:26,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:26,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:00:26,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136516631] [2019-11-16 00:00:26,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:00:26,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:00:26,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:26,980 INFO L87 Difference]: Start difference. First operand 4905 states and 10657 transitions. Second operand 7 states. [2019-11-16 00:00:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:27,150 INFO L93 Difference]: Finished difference Result 5970 states and 12894 transitions. [2019-11-16 00:00:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:00:27,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-11-16 00:00:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:27,158 INFO L225 Difference]: With dead ends: 5970 [2019-11-16 00:00:27,158 INFO L226 Difference]: Without dead ends: 5970 [2019-11-16 00:00:27,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:00:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2019-11-16 00:00:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 4579. [2019-11-16 00:00:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2019-11-16 00:00:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 9878 transitions. [2019-11-16 00:00:27,208 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 9878 transitions. Word has length 98 [2019-11-16 00:00:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:27,208 INFO L462 AbstractCegarLoop]: Abstraction has 4579 states and 9878 transitions. [2019-11-16 00:00:27,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:00:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 9878 transitions. [2019-11-16 00:00:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:27,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:27,211 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] [2019-11-16 00:00:27,212 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1391213242, now seen corresponding path program 1 times [2019-11-16 00:00:27,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:27,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132671431] [2019-11-16 00:00:27,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:27,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:27,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:27,352 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:00:27,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132671431] [2019-11-16 00:00:27,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:27,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:00:27,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964355046] [2019-11-16 00:00:27,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:00:27,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:00:27,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:00:27,354 INFO L87 Difference]: Start difference. First operand 4579 states and 9878 transitions. Second operand 10 states. [2019-11-16 00:00:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:27,811 INFO L93 Difference]: Finished difference Result 13638 states and 29903 transitions. [2019-11-16 00:00:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:00:27,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-11-16 00:00:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:27,819 INFO L225 Difference]: With dead ends: 13638 [2019-11-16 00:00:27,819 INFO L226 Difference]: Without dead ends: 8300 [2019-11-16 00:00:27,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:00:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2019-11-16 00:00:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 4068. [2019-11-16 00:00:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4068 states. [2019-11-16 00:00:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 8722 transitions. [2019-11-16 00:00:27,877 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 8722 transitions. Word has length 98 [2019-11-16 00:00:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:27,877 INFO L462 AbstractCegarLoop]: Abstraction has 4068 states and 8722 transitions. [2019-11-16 00:00:27,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:00:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 8722 transitions. [2019-11-16 00:00:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:00:27,881 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:27,881 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] [2019-11-16 00:00:27,881 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash -920238160, now seen corresponding path program 2 times [2019-11-16 00:00:27,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:27,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659851390] [2019-11-16 00:00:27,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:27,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:27,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:00:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:00:27,967 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:00:27,967 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:00:28,126 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:00:28,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:00:28 BasicIcfg [2019-11-16 00:00:28,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:00:28,129 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:00:28,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:00:28,129 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:00:28,130 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:59:44" (3/4) ... [2019-11-16 00:00:28,132 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:00:28,288 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4841210b-00e9-47fd-811c-449f0afa9328/bin/uautomizer/witness.graphml [2019-11-16 00:00:28,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:00:28,293 INFO L168 Benchmark]: Toolchain (without parser) took 45111.80 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 938.0 MB in the beginning and 1.7 GB in the end (delta: -784.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-16 00:00:28,294 INFO L168 Benchmark]: CDTParser took 0.28 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:00:28,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:28,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:28,296 INFO L168 Benchmark]: Boogie Preprocessor took 39.54 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:00:28,296 INFO L168 Benchmark]: RCFGBuilder took 975.51 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: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:28,297 INFO L168 Benchmark]: TraceAbstraction took 43236.74 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -732.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-11-16 00:00:28,297 INFO L168 Benchmark]: Witness Printer took 162.98 ms. Allocated memory is still 4.7 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 62.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:28,300 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.28 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 639.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.54 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 975.51 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: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43236.74 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -732.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 162.98 ms. Allocated memory is still 4.7 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 62.6 MB). Peak memory consumption was 62.6 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] [L703] 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, main$tmp_guard0=0] [L704] 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, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L711] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L712] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L713] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L714] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L715] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L716] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L717] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L718] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L719] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L720] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L721] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L722] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L723] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L724] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 pthread_t t241; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 pthread_t t242; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 [L744] 1 __unbuffered_p0_EAX = x [L747] 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L782] 2 z = z$flush_delayed ? z$mem_tmp : z [L783] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 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, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 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, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. Result: UNSAFE, OverallTime: 43.1s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9104 SDtfs, 9617 SDslu, 20881 SDs, 0 SdLazy, 8046 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 85 SyntacticMatches, 23 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred 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: 19.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 78521 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2487 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2356 ConstructedInterpolants, 0 QuantifiedInterpolants, 545205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...