./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt.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_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/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 b8c4c4a64e81004c1b7f76d4e0140415a80d0a4d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:29:59,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:29:59,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:29:59,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:29:59,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:29:59,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:29:59,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:29:59,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:29:59,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:29:59,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:29:59,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:29:59,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:29:59,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:29:59,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:29:59,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:29:59,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:29:59,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:29:59,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:29:59,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:29:59,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:29:59,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:29:59,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:29:59,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:29:59,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:29:59,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:29:59,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:29:59,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:29:59,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:29:59,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:29:59,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:29:59,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:29:59,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:29:59,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:29:59,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:29:59,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:29:59,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:29:59,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:29:59,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:29:59,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:29:59,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:29:59,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:29:59,155 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:29:59,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:29:59,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:29:59,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:29:59,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:29:59,169 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:29:59,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:29:59,169 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:29:59,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:29:59,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:29:59,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:29:59,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:29:59,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:29:59,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:29:59,171 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:29:59,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:29:59,171 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:29:59,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:29:59,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:29:59,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:29:59,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:29:59,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:29:59,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:29:59,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:29:59,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:29:59,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:29:59,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:29:59,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:29:59,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:29:59,174 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_e5f965a5-deb0-4662-8055-75db51de879d/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 -> b8c4c4a64e81004c1b7f76d4e0140415a80d0a4d [2019-11-16 00:29:59,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:29:59,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:29:59,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:29:59,212 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:29:59,212 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:29:59,212 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_power.opt.i [2019-11-16 00:29:59,261 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/data/43146f7b1/065a754451734a5a99050c4d09ea38eb/FLAGfdd1db819 [2019-11-16 00:29:59,747 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:29:59,753 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/sv-benchmarks/c/pthread-wmm/mix054_power.opt.i [2019-11-16 00:29:59,772 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/data/43146f7b1/065a754451734a5a99050c4d09ea38eb/FLAGfdd1db819 [2019-11-16 00:30:00,039 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/data/43146f7b1/065a754451734a5a99050c4d09ea38eb [2019-11-16 00:30:00,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:30:00,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:30:00,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:30:00,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:30:00,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:30:00,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30031fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00, skipping insertion in model container [2019-11-16 00:30:00,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,056 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:30:00,097 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:30:00,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:30:00,508 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:30:00,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:30:00,627 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:30:00,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00 WrapperNode [2019-11-16 00:30:00,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:30:00,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:30:00,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:30:00,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:30:00,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:30:00,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:30:00,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:30:00,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:30:00,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... [2019-11-16 00:30:00,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:30:00,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:30:00,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:30:00,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:30:00,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:30:00,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:30:00,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:30:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:30:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:30:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:30:00,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:30:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:30:00,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:30:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:30:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:30:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:30:00,777 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:30:01,445 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:30:01,446 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:30:01,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:01 BoogieIcfgContainer [2019-11-16 00:30:01,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:30:01,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:30:01,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:30:01,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:30:01,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:30:00" (1/3) ... [2019-11-16 00:30:01,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410edf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:01, skipping insertion in model container [2019-11-16 00:30:01,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00" (2/3) ... [2019-11-16 00:30:01,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410edf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:01, skipping insertion in model container [2019-11-16 00:30:01,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:01" (3/3) ... [2019-11-16 00:30:01,453 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.opt.i [2019-11-16 00:30:01,490 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,490 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,490 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,491 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,491 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,491 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,491 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,492 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,492 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,492 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,492 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,493 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,493 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,507 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,507 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,507 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,508 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,508 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,508 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,508 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,508 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,508 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,508 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,508 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,509 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,509 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,509 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,509 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,509 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,510 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,510 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,510 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,510 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,510 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,513 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,513 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,513 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,513 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,514 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,514 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,514 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,514 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,514 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,516 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,525 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,525 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,532 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,532 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,532 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,532 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,538 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:01,566 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:30:01,566 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:30:01,572 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:30:01,582 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:30:01,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:30:01,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:30:01,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:30:01,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:30:01,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:30:01,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:30:01,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:30:01,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:30:01,611 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 177 transitions [2019-11-16 00:30:04,142 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32589 states. [2019-11-16 00:30:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 32589 states. [2019-11-16 00:30:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:30:04,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:04,150 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] [2019-11-16 00:30:04,152 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash 737563216, now seen corresponding path program 1 times [2019-11-16 00:30:04,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:04,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453746172] [2019-11-16 00:30:04,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:04,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:04,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:04,371 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:30:04,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453746172] [2019-11-16 00:30:04,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:04,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:04,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976105649] [2019-11-16 00:30:04,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:04,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:04,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:04,391 INFO L87 Difference]: Start difference. First operand 32589 states. Second operand 4 states. [2019-11-16 00:30:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:05,261 INFO L93 Difference]: Finished difference Result 33589 states and 129566 transitions. [2019-11-16 00:30:05,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:05,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-16 00:30:05,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:05,491 INFO L225 Difference]: With dead ends: 33589 [2019-11-16 00:30:05,491 INFO L226 Difference]: Without dead ends: 25701 [2019-11-16 00:30:05,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25701 states. [2019-11-16 00:30:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25701 to 25701. [2019-11-16 00:30:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25701 states. [2019-11-16 00:30:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25701 states to 25701 states and 99582 transitions. [2019-11-16 00:30:06,997 INFO L78 Accepts]: Start accepts. Automaton has 25701 states and 99582 transitions. Word has length 32 [2019-11-16 00:30:06,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:06,998 INFO L462 AbstractCegarLoop]: Abstraction has 25701 states and 99582 transitions. [2019-11-16 00:30:06,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 25701 states and 99582 transitions. [2019-11-16 00:30:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:30:07,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:07,012 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] [2019-11-16 00:30:07,012 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1112209964, now seen corresponding path program 1 times [2019-11-16 00:30:07,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:07,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952487765] [2019-11-16 00:30:07,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:07,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:07,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:07,155 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:30:07,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952487765] [2019-11-16 00:30:07,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:07,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:07,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242418286] [2019-11-16 00:30:07,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:07,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:07,158 INFO L87 Difference]: Start difference. First operand 25701 states and 99582 transitions. Second operand 5 states. [2019-11-16 00:30:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:08,037 INFO L93 Difference]: Finished difference Result 41079 states and 150429 transitions. [2019-11-16 00:30:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:08,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-16 00:30:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:08,210 INFO L225 Difference]: With dead ends: 41079 [2019-11-16 00:30:08,210 INFO L226 Difference]: Without dead ends: 40543 [2019-11-16 00:30:08,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40543 states. [2019-11-16 00:30:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40543 to 38923. [2019-11-16 00:30:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38923 states. [2019-11-16 00:30:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38923 states to 38923 states and 143579 transitions. [2019-11-16 00:30:09,856 INFO L78 Accepts]: Start accepts. Automaton has 38923 states and 143579 transitions. Word has length 44 [2019-11-16 00:30:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:09,860 INFO L462 AbstractCegarLoop]: Abstraction has 38923 states and 143579 transitions. [2019-11-16 00:30:09,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 38923 states and 143579 transitions. [2019-11-16 00:30:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:30:09,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:09,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] [2019-11-16 00:30:09,869 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash -64291244, now seen corresponding path program 1 times [2019-11-16 00:30:09,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:09,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648123840] [2019-11-16 00:30:09,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:09,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:09,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:10,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648123840] [2019-11-16 00:30:10,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:10,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:10,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175246805] [2019-11-16 00:30:10,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:10,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:10,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:10,014 INFO L87 Difference]: Start difference. First operand 38923 states and 143579 transitions. Second operand 5 states. [2019-11-16 00:30:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:10,570 INFO L93 Difference]: Finished difference Result 49776 states and 180631 transitions. [2019-11-16 00:30:10,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:10,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:30:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:10,704 INFO L225 Difference]: With dead ends: 49776 [2019-11-16 00:30:10,705 INFO L226 Difference]: Without dead ends: 49272 [2019-11-16 00:30:10,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49272 states. [2019-11-16 00:30:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49272 to 42675. [2019-11-16 00:30:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42675 states. [2019-11-16 00:30:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42675 states to 42675 states and 156590 transitions. [2019-11-16 00:30:12,474 INFO L78 Accepts]: Start accepts. Automaton has 42675 states and 156590 transitions. Word has length 45 [2019-11-16 00:30:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:12,474 INFO L462 AbstractCegarLoop]: Abstraction has 42675 states and 156590 transitions. [2019-11-16 00:30:12,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 42675 states and 156590 transitions. [2019-11-16 00:30:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:30:12,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:12,482 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] [2019-11-16 00:30:12,483 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash -683113030, now seen corresponding path program 1 times [2019-11-16 00:30:12,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:12,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301979621] [2019-11-16 00:30:12,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:12,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:12,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:12,525 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:30:12,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301979621] [2019-11-16 00:30:12,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:12,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:30:12,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597946097] [2019-11-16 00:30:12,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:30:12,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:30:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:30:12,527 INFO L87 Difference]: Start difference. First operand 42675 states and 156590 transitions. Second operand 3 states. [2019-11-16 00:30:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:12,773 INFO L93 Difference]: Finished difference Result 61085 states and 221428 transitions. [2019-11-16 00:30:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:30:12,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-16 00:30:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:12,941 INFO L225 Difference]: With dead ends: 61085 [2019-11-16 00:30:12,942 INFO L226 Difference]: Without dead ends: 61085 [2019-11-16 00:30:12,942 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:30:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61085 states. [2019-11-16 00:30:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61085 to 48014. [2019-11-16 00:30:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48014 states. [2019-11-16 00:30:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48014 states to 48014 states and 174177 transitions. [2019-11-16 00:30:14,811 INFO L78 Accepts]: Start accepts. Automaton has 48014 states and 174177 transitions. Word has length 47 [2019-11-16 00:30:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:14,811 INFO L462 AbstractCegarLoop]: Abstraction has 48014 states and 174177 transitions. [2019-11-16 00:30:14,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:30:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 48014 states and 174177 transitions. [2019-11-16 00:30:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:30:14,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:14,826 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-16 00:30:14,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1641831505, now seen corresponding path program 1 times [2019-11-16 00:30:14,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:14,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637613625] [2019-11-16 00:30:14,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:14,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:14,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:14,948 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:30:14,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637613625] [2019-11-16 00:30:14,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:14,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:14,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828201063] [2019-11-16 00:30:14,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:14,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:14,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:14,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:14,951 INFO L87 Difference]: Start difference. First operand 48014 states and 174177 transitions. Second operand 6 states. [2019-11-16 00:30:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:15,865 INFO L93 Difference]: Finished difference Result 63754 states and 229377 transitions. [2019-11-16 00:30:15,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:15,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:30:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:19,224 INFO L225 Difference]: With dead ends: 63754 [2019-11-16 00:30:19,224 INFO L226 Difference]: Without dead ends: 63754 [2019-11-16 00:30:19,224 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:30:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63754 states. [2019-11-16 00:30:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63754 to 59947. [2019-11-16 00:30:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59947 states. [2019-11-16 00:30:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59947 states to 59947 states and 215670 transitions. [2019-11-16 00:30:20,287 INFO L78 Accepts]: Start accepts. Automaton has 59947 states and 215670 transitions. Word has length 51 [2019-11-16 00:30:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:20,287 INFO L462 AbstractCegarLoop]: Abstraction has 59947 states and 215670 transitions. [2019-11-16 00:30:20,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 59947 states and 215670 transitions. [2019-11-16 00:30:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:30:20,302 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:20,303 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-16 00:30:20,303 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash 856184432, now seen corresponding path program 1 times [2019-11-16 00:30:20,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:20,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383025395] [2019-11-16 00:30:20,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:20,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:20,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:20,398 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:30:20,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383025395] [2019-11-16 00:30:20,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:20,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:30:20,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295099828] [2019-11-16 00:30:20,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:20,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:20,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:20,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:20,400 INFO L87 Difference]: Start difference. First operand 59947 states and 215670 transitions. Second operand 7 states. [2019-11-16 00:30:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:21,466 INFO L93 Difference]: Finished difference Result 83683 states and 290095 transitions. [2019-11-16 00:30:21,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:30:21,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-16 00:30:21,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:21,620 INFO L225 Difference]: With dead ends: 83683 [2019-11-16 00:30:21,620 INFO L226 Difference]: Without dead ends: 83683 [2019-11-16 00:30:21,620 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:30:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83683 states. [2019-11-16 00:30:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83683 to 71010. [2019-11-16 00:30:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71010 states. [2019-11-16 00:30:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71010 states to 71010 states and 249884 transitions. [2019-11-16 00:30:23,403 INFO L78 Accepts]: Start accepts. Automaton has 71010 states and 249884 transitions. Word has length 51 [2019-11-16 00:30:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:23,403 INFO L462 AbstractCegarLoop]: Abstraction has 71010 states and 249884 transitions. [2019-11-16 00:30:23,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 71010 states and 249884 transitions. [2019-11-16 00:30:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:30:23,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:23,415 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-16 00:30:23,415 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1743688113, now seen corresponding path program 1 times [2019-11-16 00:30:23,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:23,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049390725] [2019-11-16 00:30:23,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:23,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:23,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:23,502 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:30:23,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049390725] [2019-11-16 00:30:23,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:23,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:23,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695972825] [2019-11-16 00:30:23,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:23,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:23,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:23,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:23,503 INFO L87 Difference]: Start difference. First operand 71010 states and 249884 transitions. Second operand 5 states. [2019-11-16 00:30:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:23,591 INFO L93 Difference]: Finished difference Result 12157 states and 37827 transitions. [2019-11-16 00:30:23,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:30:23,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-16 00:30:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:23,613 INFO L225 Difference]: With dead ends: 12157 [2019-11-16 00:30:23,613 INFO L226 Difference]: Without dead ends: 10672 [2019-11-16 00:30:23,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10672 states. [2019-11-16 00:30:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10672 to 10623. [2019-11-16 00:30:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10623 states. [2019-11-16 00:30:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10623 states to 10623 states and 32589 transitions. [2019-11-16 00:30:23,766 INFO L78 Accepts]: Start accepts. Automaton has 10623 states and 32589 transitions. Word has length 51 [2019-11-16 00:30:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:23,767 INFO L462 AbstractCegarLoop]: Abstraction has 10623 states and 32589 transitions. [2019-11-16 00:30:23,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 10623 states and 32589 transitions. [2019-11-16 00:30:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:30:23,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:23,769 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-16 00:30:23,769 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1023975291, now seen corresponding path program 1 times [2019-11-16 00:30:23,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:23,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766397838] [2019-11-16 00:30:23,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:23,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:23,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:23,836 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:30:23,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766397838] [2019-11-16 00:30:23,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:23,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:23,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971955740] [2019-11-16 00:30:23,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:23,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:23,837 INFO L87 Difference]: Start difference. First operand 10623 states and 32589 transitions. Second operand 6 states. [2019-11-16 00:30:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:24,234 INFO L93 Difference]: Finished difference Result 13180 states and 39870 transitions. [2019-11-16 00:30:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:30:24,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:30:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:24,255 INFO L225 Difference]: With dead ends: 13180 [2019-11-16 00:30:24,256 INFO L226 Difference]: Without dead ends: 13117 [2019-11-16 00:30:24,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:30:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13117 states. [2019-11-16 00:30:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13117 to 11046. [2019-11-16 00:30:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11046 states. [2019-11-16 00:30:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11046 states to 11046 states and 33783 transitions. [2019-11-16 00:30:24,424 INFO L78 Accepts]: Start accepts. Automaton has 11046 states and 33783 transitions. Word has length 51 [2019-11-16 00:30:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:24,425 INFO L462 AbstractCegarLoop]: Abstraction has 11046 states and 33783 transitions. [2019-11-16 00:30:24,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 11046 states and 33783 transitions. [2019-11-16 00:30:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:30:24,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:24,428 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] [2019-11-16 00:30:24,428 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:24,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:24,428 INFO L82 PathProgramCache]: Analyzing trace with hash -126708958, now seen corresponding path program 1 times [2019-11-16 00:30:24,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:24,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166788] [2019-11-16 00:30:24,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:24,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:24,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:24,480 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:30:24,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166788] [2019-11-16 00:30:24,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:24,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:24,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458196739] [2019-11-16 00:30:24,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:24,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:24,482 INFO L87 Difference]: Start difference. First operand 11046 states and 33783 transitions. Second operand 4 states. [2019-11-16 00:30:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:24,623 INFO L93 Difference]: Finished difference Result 12860 states and 39389 transitions. [2019-11-16 00:30:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:30:24,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-16 00:30:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:24,652 INFO L225 Difference]: With dead ends: 12860 [2019-11-16 00:30:24,652 INFO L226 Difference]: Without dead ends: 12860 [2019-11-16 00:30:24,653 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:30:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12860 states. [2019-11-16 00:30:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12860 to 11691. [2019-11-16 00:30:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11691 states. [2019-11-16 00:30:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11691 states to 11691 states and 35760 transitions. [2019-11-16 00:30:24,926 INFO L78 Accepts]: Start accepts. Automaton has 11691 states and 35760 transitions. Word has length 59 [2019-11-16 00:30:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:24,926 INFO L462 AbstractCegarLoop]: Abstraction has 11691 states and 35760 transitions. [2019-11-16 00:30:24,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11691 states and 35760 transitions. [2019-11-16 00:30:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:30:24,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:24,929 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] [2019-11-16 00:30:24,929 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1616101377, now seen corresponding path program 1 times [2019-11-16 00:30:24,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:24,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256795414] [2019-11-16 00:30:24,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:24,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:24,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:25,018 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:30:25,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256795414] [2019-11-16 00:30:25,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:25,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:25,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356959926] [2019-11-16 00:30:25,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:25,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:25,020 INFO L87 Difference]: Start difference. First operand 11691 states and 35760 transitions. Second operand 6 states. [2019-11-16 00:30:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:25,421 INFO L93 Difference]: Finished difference Result 14217 states and 42858 transitions. [2019-11-16 00:30:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:30:25,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-16 00:30:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:25,443 INFO L225 Difference]: With dead ends: 14217 [2019-11-16 00:30:25,444 INFO L226 Difference]: Without dead ends: 14156 [2019-11-16 00:30:25,444 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:30:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-11-16 00:30:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 13459. [2019-11-16 00:30:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13459 states. [2019-11-16 00:30:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 40777 transitions. [2019-11-16 00:30:25,678 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 40777 transitions. Word has length 59 [2019-11-16 00:30:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:25,678 INFO L462 AbstractCegarLoop]: Abstraction has 13459 states and 40777 transitions. [2019-11-16 00:30:25,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 40777 transitions. [2019-11-16 00:30:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:30:25,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:25,683 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:30:25,684 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:25,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1913952989, now seen corresponding path program 1 times [2019-11-16 00:30:25,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:25,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788300077] [2019-11-16 00:30:25,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:25,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:25,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:25,735 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:30:25,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788300077] [2019-11-16 00:30:25,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:25,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:25,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780053842] [2019-11-16 00:30:25,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:25,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:25,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:25,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:25,736 INFO L87 Difference]: Start difference. First operand 13459 states and 40777 transitions. Second operand 4 states. [2019-11-16 00:30:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:26,019 INFO L93 Difference]: Finished difference Result 16501 states and 49369 transitions. [2019-11-16 00:30:26,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:26,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-16 00:30:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:26,039 INFO L225 Difference]: With dead ends: 16501 [2019-11-16 00:30:26,039 INFO L226 Difference]: Without dead ends: 16501 [2019-11-16 00:30:26,040 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:30:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16501 states. [2019-11-16 00:30:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16501 to 14980. [2019-11-16 00:30:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14980 states. [2019-11-16 00:30:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14980 states to 14980 states and 44958 transitions. [2019-11-16 00:30:26,226 INFO L78 Accepts]: Start accepts. Automaton has 14980 states and 44958 transitions. Word has length 63 [2019-11-16 00:30:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:26,227 INFO L462 AbstractCegarLoop]: Abstraction has 14980 states and 44958 transitions. [2019-11-16 00:30:26,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 14980 states and 44958 transitions. [2019-11-16 00:30:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:30:26,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:26,233 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:30:26,233 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1659216444, now seen corresponding path program 1 times [2019-11-16 00:30:26,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:26,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42564840] [2019-11-16 00:30:26,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:26,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:26,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:26,279 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:30:26,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42564840] [2019-11-16 00:30:26,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:26,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:30:26,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396517946] [2019-11-16 00:30:26,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:30:26,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:26,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:30:26,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:30:26,281 INFO L87 Difference]: Start difference. First operand 14980 states and 44958 transitions. Second operand 3 states. [2019-11-16 00:30:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:26,512 INFO L93 Difference]: Finished difference Result 15528 states and 46401 transitions. [2019-11-16 00:30:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:30:26,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-16 00:30:26,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:26,532 INFO L225 Difference]: With dead ends: 15528 [2019-11-16 00:30:26,532 INFO L226 Difference]: Without dead ends: 15528 [2019-11-16 00:30:26,532 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:30:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2019-11-16 00:30:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 15274. [2019-11-16 00:30:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15274 states. [2019-11-16 00:30:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15274 states to 15274 states and 45726 transitions. [2019-11-16 00:30:26,715 INFO L78 Accepts]: Start accepts. Automaton has 15274 states and 45726 transitions. Word has length 63 [2019-11-16 00:30:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:26,715 INFO L462 AbstractCegarLoop]: Abstraction has 15274 states and 45726 transitions. [2019-11-16 00:30:26,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:30:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15274 states and 45726 transitions. [2019-11-16 00:30:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:26,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:26,722 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] [2019-11-16 00:30:26,723 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:26,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:26,723 INFO L82 PathProgramCache]: Analyzing trace with hash -939220032, now seen corresponding path program 1 times [2019-11-16 00:30:26,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:26,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204059297] [2019-11-16 00:30:26,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:26,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:26,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:26,822 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:30:26,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204059297] [2019-11-16 00:30:26,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:26,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:26,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391629472] [2019-11-16 00:30:26,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:26,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:26,824 INFO L87 Difference]: Start difference. First operand 15274 states and 45726 transitions. Second operand 6 states. [2019-11-16 00:30:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:27,376 INFO L93 Difference]: Finished difference Result 16271 states and 48101 transitions. [2019-11-16 00:30:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:27,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:30:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:27,396 INFO L225 Difference]: With dead ends: 16271 [2019-11-16 00:30:27,396 INFO L226 Difference]: Without dead ends: 16271 [2019-11-16 00:30:27,396 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:30:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16271 states. [2019-11-16 00:30:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16271 to 15847. [2019-11-16 00:30:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15847 states. [2019-11-16 00:30:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15847 states to 15847 states and 47023 transitions. [2019-11-16 00:30:27,587 INFO L78 Accepts]: Start accepts. Automaton has 15847 states and 47023 transitions. Word has length 65 [2019-11-16 00:30:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:27,588 INFO L462 AbstractCegarLoop]: Abstraction has 15847 states and 47023 transitions. [2019-11-16 00:30:27,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 15847 states and 47023 transitions. [2019-11-16 00:30:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:27,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:27,596 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] [2019-11-16 00:30:27,596 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1193956577, now seen corresponding path program 1 times [2019-11-16 00:30:27,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:27,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603888810] [2019-11-16 00:30:27,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:27,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:27,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:27,696 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:30:27,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603888810] [2019-11-16 00:30:27,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:27,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:27,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585532780] [2019-11-16 00:30:27,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:27,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:27,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:27,697 INFO L87 Difference]: Start difference. First operand 15847 states and 47023 transitions. Second operand 6 states. [2019-11-16 00:30:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:28,168 INFO L93 Difference]: Finished difference Result 18158 states and 52351 transitions. [2019-11-16 00:30:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:30:28,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:30:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:28,189 INFO L225 Difference]: With dead ends: 18158 [2019-11-16 00:30:28,189 INFO L226 Difference]: Without dead ends: 18158 [2019-11-16 00:30:28,189 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:30:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18158 states. [2019-11-16 00:30:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18158 to 16539. [2019-11-16 00:30:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16539 states. [2019-11-16 00:30:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16539 states to 16539 states and 48243 transitions. [2019-11-16 00:30:28,386 INFO L78 Accepts]: Start accepts. Automaton has 16539 states and 48243 transitions. Word has length 65 [2019-11-16 00:30:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:28,386 INFO L462 AbstractCegarLoop]: Abstraction has 16539 states and 48243 transitions. [2019-11-16 00:30:28,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16539 states and 48243 transitions. [2019-11-16 00:30:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:28,394 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:28,394 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] [2019-11-16 00:30:28,394 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1260963330, now seen corresponding path program 1 times [2019-11-16 00:30:28,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:28,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472507256] [2019-11-16 00:30:28,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:28,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:28,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:28,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:30:28,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472507256] [2019-11-16 00:30:28,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:28,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:28,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467371340] [2019-11-16 00:30:28,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:28,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:28,469 INFO L87 Difference]: Start difference. First operand 16539 states and 48243 transitions. Second operand 5 states. [2019-11-16 00:30:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:28,831 INFO L93 Difference]: Finished difference Result 21453 states and 62483 transitions. [2019-11-16 00:30:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:30:28,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:30:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:28,856 INFO L225 Difference]: With dead ends: 21453 [2019-11-16 00:30:28,856 INFO L226 Difference]: Without dead ends: 21453 [2019-11-16 00:30:28,856 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:30:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21453 states. [2019-11-16 00:30:29,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21453 to 19518. [2019-11-16 00:30:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19518 states. [2019-11-16 00:30:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 56652 transitions. [2019-11-16 00:30:29,144 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 56652 transitions. Word has length 65 [2019-11-16 00:30:29,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:29,144 INFO L462 AbstractCegarLoop]: Abstraction has 19518 states and 56652 transitions. [2019-11-16 00:30:29,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 56652 transitions. [2019-11-16 00:30:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:29,156 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:29,156 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] [2019-11-16 00:30:29,156 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1771497507, now seen corresponding path program 1 times [2019-11-16 00:30:29,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:29,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522978629] [2019-11-16 00:30:29,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:29,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:29,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:29,232 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:30:29,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522978629] [2019-11-16 00:30:29,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:29,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:29,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076896702] [2019-11-16 00:30:29,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:29,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:29,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:29,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:29,244 INFO L87 Difference]: Start difference. First operand 19518 states and 56652 transitions. Second operand 5 states. [2019-11-16 00:30:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:29,813 INFO L93 Difference]: Finished difference Result 26405 states and 76310 transitions. [2019-11-16 00:30:29,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:29,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:30:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:29,845 INFO L225 Difference]: With dead ends: 26405 [2019-11-16 00:30:29,845 INFO L226 Difference]: Without dead ends: 26405 [2019-11-16 00:30:29,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26405 states. [2019-11-16 00:30:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26405 to 21406. [2019-11-16 00:30:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21406 states. [2019-11-16 00:30:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21406 states to 21406 states and 61926 transitions. [2019-11-16 00:30:30,124 INFO L78 Accepts]: Start accepts. Automaton has 21406 states and 61926 transitions. Word has length 65 [2019-11-16 00:30:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:30,124 INFO L462 AbstractCegarLoop]: Abstraction has 21406 states and 61926 transitions. [2019-11-16 00:30:30,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 21406 states and 61926 transitions. [2019-11-16 00:30:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:30,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:30,133 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] [2019-11-16 00:30:30,133 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:30,133 INFO L82 PathProgramCache]: Analyzing trace with hash 716015326, now seen corresponding path program 1 times [2019-11-16 00:30:30,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:30,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204649387] [2019-11-16 00:30:30,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:30,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:30,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:30,191 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:30:30,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204649387] [2019-11-16 00:30:30,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:30,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:30,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197282429] [2019-11-16 00:30:30,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:30,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:30,194 INFO L87 Difference]: Start difference. First operand 21406 states and 61926 transitions. Second operand 4 states. [2019-11-16 00:30:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:30,675 INFO L93 Difference]: Finished difference Result 27967 states and 81348 transitions. [2019-11-16 00:30:30,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:30:30,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:30:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:30,711 INFO L225 Difference]: With dead ends: 27967 [2019-11-16 00:30:30,711 INFO L226 Difference]: Without dead ends: 27832 [2019-11-16 00:30:30,711 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:30:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27832 states. [2019-11-16 00:30:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27832 to 25843. [2019-11-16 00:30:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25843 states. [2019-11-16 00:30:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25843 states to 25843 states and 75186 transitions. [2019-11-16 00:30:31,042 INFO L78 Accepts]: Start accepts. Automaton has 25843 states and 75186 transitions. Word has length 65 [2019-11-16 00:30:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:31,042 INFO L462 AbstractCegarLoop]: Abstraction has 25843 states and 75186 transitions. [2019-11-16 00:30:31,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 25843 states and 75186 transitions. [2019-11-16 00:30:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:31,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:31,049 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] [2019-11-16 00:30:31,049 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1080936033, now seen corresponding path program 1 times [2019-11-16 00:30:31,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:31,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42065200] [2019-11-16 00:30:31,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:31,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:31,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:31,185 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:30:31,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42065200] [2019-11-16 00:30:31,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:31,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:30:31,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717663936] [2019-11-16 00:30:31,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:31,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:31,186 INFO L87 Difference]: Start difference. First operand 25843 states and 75186 transitions. Second operand 7 states. [2019-11-16 00:30:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:31,644 INFO L93 Difference]: Finished difference Result 23111 states and 64208 transitions. [2019-11-16 00:30:31,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:30:31,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-16 00:30:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:31,669 INFO L225 Difference]: With dead ends: 23111 [2019-11-16 00:30:31,669 INFO L226 Difference]: Without dead ends: 23111 [2019-11-16 00:30:31,670 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:30:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23111 states. [2019-11-16 00:30:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23111 to 18807. [2019-11-16 00:30:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-11-16 00:30:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 52243 transitions. [2019-11-16 00:30:31,905 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 52243 transitions. Word has length 65 [2019-11-16 00:30:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:31,906 INFO L462 AbstractCegarLoop]: Abstraction has 18807 states and 52243 transitions. [2019-11-16 00:30:31,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 52243 transitions. [2019-11-16 00:30:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:31,912 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:31,912 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] [2019-11-16 00:30:31,912 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash -193432352, now seen corresponding path program 1 times [2019-11-16 00:30:31,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:31,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532778504] [2019-11-16 00:30:31,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:31,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:31,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:31,992 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:30:31,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532778504] [2019-11-16 00:30:31,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:31,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:31,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207896498] [2019-11-16 00:30:31,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:31,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:31,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:31,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:31,995 INFO L87 Difference]: Start difference. First operand 18807 states and 52243 transitions. Second operand 5 states. [2019-11-16 00:30:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:32,052 INFO L93 Difference]: Finished difference Result 6129 states and 14460 transitions. [2019-11-16 00:30:32,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:30:32,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:30:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:32,058 INFO L225 Difference]: With dead ends: 6129 [2019-11-16 00:30:32,058 INFO L226 Difference]: Without dead ends: 5259 [2019-11-16 00:30:32,059 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:30:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-11-16 00:30:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4724. [2019-11-16 00:30:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-11-16 00:30:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 10819 transitions. [2019-11-16 00:30:32,122 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 10819 transitions. Word has length 65 [2019-11-16 00:30:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:32,122 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 10819 transitions. [2019-11-16 00:30:32,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 10819 transitions. [2019-11-16 00:30:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:32,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:32,125 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] [2019-11-16 00:30:32,125 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:32,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:32,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2083784590, now seen corresponding path program 1 times [2019-11-16 00:30:32,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:32,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621521609] [2019-11-16 00:30:32,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:32,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:32,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:32,170 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:30:32,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621521609] [2019-11-16 00:30:32,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:32,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:30:32,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640129714] [2019-11-16 00:30:32,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:30:32,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:30:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:30:32,172 INFO L87 Difference]: Start difference. First operand 4724 states and 10819 transitions. Second operand 3 states. [2019-11-16 00:30:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:32,207 INFO L93 Difference]: Finished difference Result 5854 states and 13185 transitions. [2019-11-16 00:30:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:30:32,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-16 00:30:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:32,214 INFO L225 Difference]: With dead ends: 5854 [2019-11-16 00:30:32,214 INFO L226 Difference]: Without dead ends: 5854 [2019-11-16 00:30:32,214 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:30:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-11-16 00:30:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 4659. [2019-11-16 00:30:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-11-16 00:30:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 10381 transitions. [2019-11-16 00:30:32,271 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 10381 transitions. Word has length 65 [2019-11-16 00:30:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:32,271 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 10381 transitions. [2019-11-16 00:30:32,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:30:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 10381 transitions. [2019-11-16 00:30:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:30:32,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:32,274 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] [2019-11-16 00:30:32,275 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1306291909, now seen corresponding path program 1 times [2019-11-16 00:30:32,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:32,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039208869] [2019-11-16 00:30:32,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:32,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:32,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:32,330 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:30:32,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039208869] [2019-11-16 00:30:32,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:32,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:32,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023699123] [2019-11-16 00:30:32,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:32,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:32,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:32,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:32,336 INFO L87 Difference]: Start difference. First operand 4659 states and 10381 transitions. Second operand 5 states. [2019-11-16 00:30:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:32,476 INFO L93 Difference]: Finished difference Result 5720 states and 12810 transitions. [2019-11-16 00:30:32,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:30:32,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-16 00:30:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:32,481 INFO L225 Difference]: With dead ends: 5720 [2019-11-16 00:30:32,481 INFO L226 Difference]: Without dead ends: 5720 [2019-11-16 00:30:32,481 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:30:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2019-11-16 00:30:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5079. [2019-11-16 00:30:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2019-11-16 00:30:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11339 transitions. [2019-11-16 00:30:32,526 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11339 transitions. Word has length 71 [2019-11-16 00:30:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:32,527 INFO L462 AbstractCegarLoop]: Abstraction has 5079 states and 11339 transitions. [2019-11-16 00:30:32,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11339 transitions. [2019-11-16 00:30:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:30:32,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:32,531 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] [2019-11-16 00:30:32,531 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:32,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1245865052, now seen corresponding path program 1 times [2019-11-16 00:30:32,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:32,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785127061] [2019-11-16 00:30:32,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:32,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:32,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:32,608 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:30:32,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785127061] [2019-11-16 00:30:32,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:32,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:30:32,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027708787] [2019-11-16 00:30:32,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:32,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:32,610 INFO L87 Difference]: Start difference. First operand 5079 states and 11339 transitions. Second operand 7 states. [2019-11-16 00:30:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:33,055 INFO L93 Difference]: Finished difference Result 5819 states and 12862 transitions. [2019-11-16 00:30:33,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:30:33,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-11-16 00:30:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:33,062 INFO L225 Difference]: With dead ends: 5819 [2019-11-16 00:30:33,062 INFO L226 Difference]: Without dead ends: 5766 [2019-11-16 00:30:33,062 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:30:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-11-16 00:30:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5166. [2019-11-16 00:30:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-16 00:30:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 11428 transitions. [2019-11-16 00:30:33,132 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 11428 transitions. Word has length 71 [2019-11-16 00:30:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:33,132 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 11428 transitions. [2019-11-16 00:30:33,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 11428 transitions. [2019-11-16 00:30:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:30:33,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:33,139 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] [2019-11-16 00:30:33,139 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1822532973, now seen corresponding path program 1 times [2019-11-16 00:30:33,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:33,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515219207] [2019-11-16 00:30:33,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:33,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:33,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:33,329 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:30:33,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515219207] [2019-11-16 00:30:33,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:33,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:30:33,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246536012] [2019-11-16 00:30:33,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:30:33,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:30:33,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:30:33,331 INFO L87 Difference]: Start difference. First operand 5166 states and 11428 transitions. Second operand 9 states. [2019-11-16 00:30:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:33,921 INFO L93 Difference]: Finished difference Result 7248 states and 16035 transitions. [2019-11-16 00:30:33,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:30:33,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-11-16 00:30:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:33,926 INFO L225 Difference]: With dead ends: 7248 [2019-11-16 00:30:33,926 INFO L226 Difference]: Without dead ends: 7220 [2019-11-16 00:30:33,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:30:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2019-11-16 00:30:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6152. [2019-11-16 00:30:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2019-11-16 00:30:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13790 transitions. [2019-11-16 00:30:33,989 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13790 transitions. Word has length 92 [2019-11-16 00:30:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:33,989 INFO L462 AbstractCegarLoop]: Abstraction has 6152 states and 13790 transitions. [2019-11-16 00:30:33,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:30:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13790 transitions. [2019-11-16 00:30:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:30:33,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:33,995 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] [2019-11-16 00:30:33,995 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash -254676370, now seen corresponding path program 1 times [2019-11-16 00:30:33,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:33,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766010076] [2019-11-16 00:30:33,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:33,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:33,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:34,054 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:30:34,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766010076] [2019-11-16 00:30:34,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:34,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:34,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875945811] [2019-11-16 00:30:34,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:34,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:34,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:34,056 INFO L87 Difference]: Start difference. First operand 6152 states and 13790 transitions. Second operand 4 states. [2019-11-16 00:30:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:34,181 INFO L93 Difference]: Finished difference Result 7220 states and 16033 transitions. [2019-11-16 00:30:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:34,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-16 00:30:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:34,189 INFO L225 Difference]: With dead ends: 7220 [2019-11-16 00:30:34,189 INFO L226 Difference]: Without dead ends: 7220 [2019-11-16 00:30:34,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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:30:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2019-11-16 00:30:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6335. [2019-11-16 00:30:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6335 states. [2019-11-16 00:30:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 14127 transitions. [2019-11-16 00:30:34,276 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 14127 transitions. Word has length 92 [2019-11-16 00:30:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:34,276 INFO L462 AbstractCegarLoop]: Abstraction has 6335 states and 14127 transitions. [2019-11-16 00:30:34,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 14127 transitions. [2019-11-16 00:30:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:34,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:34,284 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] [2019-11-16 00:30:34,284 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash -741091311, now seen corresponding path program 1 times [2019-11-16 00:30:34,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:34,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650146908] [2019-11-16 00:30:34,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:34,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:34,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:34,327 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:30:34,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650146908] [2019-11-16 00:30:34,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:34,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:30:34,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410084262] [2019-11-16 00:30:34,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:30:34,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:34,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:30:34,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:30:34,329 INFO L87 Difference]: Start difference. First operand 6335 states and 14127 transitions. Second operand 3 states. [2019-11-16 00:30:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:34,422 INFO L93 Difference]: Finished difference Result 6878 states and 15281 transitions. [2019-11-16 00:30:34,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:30:34,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-16 00:30:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:34,427 INFO L225 Difference]: With dead ends: 6878 [2019-11-16 00:30:34,427 INFO L226 Difference]: Without dead ends: 6878 [2019-11-16 00:30:34,428 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:30:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2019-11-16 00:30:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 6808. [2019-11-16 00:30:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6808 states. [2019-11-16 00:30:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 15131 transitions. [2019-11-16 00:30:34,536 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 15131 transitions. Word has length 94 [2019-11-16 00:30:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:34,536 INFO L462 AbstractCegarLoop]: Abstraction has 6808 states and 15131 transitions. [2019-11-16 00:30:34,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:30:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 15131 transitions. [2019-11-16 00:30:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:34,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:34,542 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] [2019-11-16 00:30:34,542 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1557627920, now seen corresponding path program 1 times [2019-11-16 00:30:34,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:34,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111004537] [2019-11-16 00:30:34,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:34,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:34,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:34,602 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:30:34,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111004537] [2019-11-16 00:30:34,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:34,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:34,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202524373] [2019-11-16 00:30:34,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:34,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:34,604 INFO L87 Difference]: Start difference. First operand 6808 states and 15131 transitions. Second operand 5 states. [2019-11-16 00:30:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:34,703 INFO L93 Difference]: Finished difference Result 7076 states and 15692 transitions. [2019-11-16 00:30:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:30:34,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:30:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:34,709 INFO L225 Difference]: With dead ends: 7076 [2019-11-16 00:30:34,709 INFO L226 Difference]: Without dead ends: 7076 [2019-11-16 00:30:34,709 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:30:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states. [2019-11-16 00:30:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 5598. [2019-11-16 00:30:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-11-16 00:30:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 12422 transitions. [2019-11-16 00:30:34,762 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 12422 transitions. Word has length 94 [2019-11-16 00:30:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:34,762 INFO L462 AbstractCegarLoop]: Abstraction has 5598 states and 12422 transitions. [2019-11-16 00:30:34,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 12422 transitions. [2019-11-16 00:30:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:34,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:34,771 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] [2019-11-16 00:30:34,771 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:34,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:34,772 INFO L82 PathProgramCache]: Analyzing trace with hash 284400688, now seen corresponding path program 1 times [2019-11-16 00:30:34,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:34,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363056928] [2019-11-16 00:30:34,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:34,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:34,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:34,856 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:30:34,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363056928] [2019-11-16 00:30:34,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:34,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:34,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300530207] [2019-11-16 00:30:34,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:34,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:34,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:34,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:34,858 INFO L87 Difference]: Start difference. First operand 5598 states and 12422 transitions. Second operand 6 states. [2019-11-16 00:30:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:35,107 INFO L93 Difference]: Finished difference Result 6709 states and 14763 transitions. [2019-11-16 00:30:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:30:35,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:30:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:35,112 INFO L225 Difference]: With dead ends: 6709 [2019-11-16 00:30:35,113 INFO L226 Difference]: Without dead ends: 6709 [2019-11-16 00:30:35,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 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:30:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-11-16 00:30:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 5275. [2019-11-16 00:30:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5275 states. [2019-11-16 00:30:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 11760 transitions. [2019-11-16 00:30:35,165 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 11760 transitions. Word has length 94 [2019-11-16 00:30:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:35,165 INFO L462 AbstractCegarLoop]: Abstraction has 5275 states and 11760 transitions. [2019-11-16 00:30:35,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 11760 transitions. [2019-11-16 00:30:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:35,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:35,169 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] [2019-11-16 00:30:35,170 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1740516082, now seen corresponding path program 1 times [2019-11-16 00:30:35,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:35,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344299359] [2019-11-16 00:30:35,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:35,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:35,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:35,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:30:35,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344299359] [2019-11-16 00:30:35,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:35,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:30:35,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589426622] [2019-11-16 00:30:35,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:30:35,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:35,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:30:35,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:30:35,408 INFO L87 Difference]: Start difference. First operand 5275 states and 11760 transitions. Second operand 10 states. [2019-11-16 00:30:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:36,387 INFO L93 Difference]: Finished difference Result 6303 states and 13926 transitions. [2019-11-16 00:30:36,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:30:36,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-16 00:30:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:36,394 INFO L225 Difference]: With dead ends: 6303 [2019-11-16 00:30:36,394 INFO L226 Difference]: Without dead ends: 6287 [2019-11-16 00:30:36,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:30:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6287 states. [2019-11-16 00:30:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6287 to 5580. [2019-11-16 00:30:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5580 states. [2019-11-16 00:30:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 12441 transitions. [2019-11-16 00:30:36,471 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 12441 transitions. Word has length 94 [2019-11-16 00:30:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:36,472 INFO L462 AbstractCegarLoop]: Abstraction has 5580 states and 12441 transitions. [2019-11-16 00:30:36,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:30:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 12441 transitions. [2019-11-16 00:30:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:36,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:36,478 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] [2019-11-16 00:30:36,478 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:36,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash -336693261, now seen corresponding path program 1 times [2019-11-16 00:30:36,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:36,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968837131] [2019-11-16 00:30:36,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:36,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:36,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:36,572 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:30:36,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968837131] [2019-11-16 00:30:36,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:36,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:36,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722938864] [2019-11-16 00:30:36,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:36,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:36,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:36,574 INFO L87 Difference]: Start difference. First operand 5580 states and 12441 transitions. Second operand 6 states. [2019-11-16 00:30:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:36,736 INFO L93 Difference]: Finished difference Result 5442 states and 11943 transitions. [2019-11-16 00:30:36,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:30:36,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:30:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:36,742 INFO L225 Difference]: With dead ends: 5442 [2019-11-16 00:30:36,742 INFO L226 Difference]: Without dead ends: 5442 [2019-11-16 00:30:36,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2019-11-16 00:30:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 4838. [2019-11-16 00:30:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4838 states. [2019-11-16 00:30:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 10735 transitions. [2019-11-16 00:30:36,806 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 10735 transitions. Word has length 94 [2019-11-16 00:30:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:36,806 INFO L462 AbstractCegarLoop]: Abstraction has 4838 states and 10735 transitions. [2019-11-16 00:30:36,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 10735 transitions. [2019-11-16 00:30:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:36,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:36,811 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] [2019-11-16 00:30:36,812 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:36,812 INFO L82 PathProgramCache]: Analyzing trace with hash 819614451, now seen corresponding path program 1 times [2019-11-16 00:30:36,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:36,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769459521] [2019-11-16 00:30:36,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:36,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:36,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:36,983 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:30:36,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769459521] [2019-11-16 00:30:36,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:36,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:30:36,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698033689] [2019-11-16 00:30:36,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:30:36,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:30:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:30:36,985 INFO L87 Difference]: Start difference. First operand 4838 states and 10735 transitions. Second operand 9 states. [2019-11-16 00:30:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:37,728 INFO L93 Difference]: Finished difference Result 6317 states and 13852 transitions. [2019-11-16 00:30:37,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:30:37,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-16 00:30:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:37,735 INFO L225 Difference]: With dead ends: 6317 [2019-11-16 00:30:37,735 INFO L226 Difference]: Without dead ends: 6317 [2019-11-16 00:30:37,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:30:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2019-11-16 00:30:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5263. [2019-11-16 00:30:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5263 states. [2019-11-16 00:30:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 11595 transitions. [2019-11-16 00:30:37,810 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 11595 transitions. Word has length 94 [2019-11-16 00:30:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:37,810 INFO L462 AbstractCegarLoop]: Abstraction has 5263 states and 11595 transitions. [2019-11-16 00:30:37,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:30:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 11595 transitions. [2019-11-16 00:30:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:37,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:37,816 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] [2019-11-16 00:30:37,816 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:37,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1030965364, now seen corresponding path program 1 times [2019-11-16 00:30:37,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:37,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571652291] [2019-11-16 00:30:37,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:37,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:37,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:37,979 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:30:37,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571652291] [2019-11-16 00:30:37,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:37,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:30:37,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713891207] [2019-11-16 00:30:37,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:30:37,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:30:37,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:30:37,981 INFO L87 Difference]: Start difference. First operand 5263 states and 11595 transitions. Second operand 9 states. [2019-11-16 00:30:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:38,555 INFO L93 Difference]: Finished difference Result 6028 states and 13188 transitions. [2019-11-16 00:30:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:30:38,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-16 00:30:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:38,561 INFO L225 Difference]: With dead ends: 6028 [2019-11-16 00:30:38,561 INFO L226 Difference]: Without dead ends: 6028 [2019-11-16 00:30:38,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:30:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2019-11-16 00:30:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 5575. [2019-11-16 00:30:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5575 states. [2019-11-16 00:30:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 12249 transitions. [2019-11-16 00:30:38,633 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 12249 transitions. Word has length 94 [2019-11-16 00:30:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:38,633 INFO L462 AbstractCegarLoop]: Abstraction has 5575 states and 12249 transitions. [2019-11-16 00:30:38,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:30:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 12249 transitions. [2019-11-16 00:30:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:38,639 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:38,640 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] [2019-11-16 00:30:38,640 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1918469045, now seen corresponding path program 1 times [2019-11-16 00:30:38,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:38,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978349551] [2019-11-16 00:30:38,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:38,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:38,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:38,808 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:30:38,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978349551] [2019-11-16 00:30:38,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:38,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:30:38,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690522716] [2019-11-16 00:30:38,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:30:38,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:38,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:30:38,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:30:38,813 INFO L87 Difference]: Start difference. First operand 5575 states and 12249 transitions. Second operand 10 states. [2019-11-16 00:30:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:39,504 INFO L93 Difference]: Finished difference Result 21556 states and 48001 transitions. [2019-11-16 00:30:39,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:30:39,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-16 00:30:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:39,518 INFO L225 Difference]: With dead ends: 21556 [2019-11-16 00:30:39,518 INFO L226 Difference]: Without dead ends: 12443 [2019-11-16 00:30:39,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:30:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12443 states. [2019-11-16 00:30:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12443 to 5226. [2019-11-16 00:30:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5226 states. [2019-11-16 00:30:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 11417 transitions. [2019-11-16 00:30:39,625 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 11417 transitions. Word has length 94 [2019-11-16 00:30:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:39,626 INFO L462 AbstractCegarLoop]: Abstraction has 5226 states and 11417 transitions. [2019-11-16 00:30:39,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:30:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 11417 transitions. [2019-11-16 00:30:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:39,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:39,631 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] [2019-11-16 00:30:39,632 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:39,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1724237327, now seen corresponding path program 2 times [2019-11-16 00:30:39,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:39,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914470290] [2019-11-16 00:30:39,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:39,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:39,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:39,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:30:39,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914470290] [2019-11-16 00:30:39,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:39,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:39,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249640994] [2019-11-16 00:30:39,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:39,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:39,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:39,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:39,728 INFO L87 Difference]: Start difference. First operand 5226 states and 11417 transitions. Second operand 5 states. [2019-11-16 00:30:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:39,787 INFO L93 Difference]: Finished difference Result 5396 states and 11680 transitions. [2019-11-16 00:30:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:39,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:30:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:39,792 INFO L225 Difference]: With dead ends: 5396 [2019-11-16 00:30:39,792 INFO L226 Difference]: Without dead ends: 5396 [2019-11-16 00:30:39,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2019-11-16 00:30:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5291. [2019-11-16 00:30:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5291 states. [2019-11-16 00:30:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 11465 transitions. [2019-11-16 00:30:39,858 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 11465 transitions. Word has length 94 [2019-11-16 00:30:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:39,858 INFO L462 AbstractCegarLoop]: Abstraction has 5291 states and 11465 transitions. [2019-11-16 00:30:39,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 11465 transitions. [2019-11-16 00:30:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:30:39,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:39,864 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] [2019-11-16 00:30:39,865 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:39,865 INFO L82 PathProgramCache]: Analyzing trace with hash 459439600, now seen corresponding path program 1 times [2019-11-16 00:30:39,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:39,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722030518] [2019-11-16 00:30:39,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:39,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:39,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:39,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:30:39,947 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:30:40,110 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:30:40,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:30:40 BasicIcfg [2019-11-16 00:30:40,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:30:40,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:30:40,114 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:30:40,114 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:30:40,115 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:01" (3/4) ... [2019-11-16 00:30:40,130 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:30:40,278 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e5f965a5-deb0-4662-8055-75db51de879d/bin/uautomizer/witness.graphml [2019-11-16 00:30:40,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:30:40,281 INFO L168 Benchmark]: Toolchain (without parser) took 40237.77 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 938.0 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-16 00:30:40,281 INFO L168 Benchmark]: CDTParser took 0.17 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:30:40,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:40,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:40,282 INFO L168 Benchmark]: Boogie Preprocessor took 39.84 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:30:40,283 INFO L168 Benchmark]: RCFGBuilder took 726.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:40,283 INFO L168 Benchmark]: TraceAbstraction took 38665.76 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-16 00:30:40,283 INFO L168 Benchmark]: Witness Printer took 164.64 ms. Allocated memory is still 4.5 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:40,285 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.17 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 584.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.84 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 726.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38665.76 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 164.64 ms. Allocated memory is still 4.5 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1443; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1443, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1444; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1444, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 217 locations, 3 error locations. Result: UNSAFE, OverallTime: 38.5s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9503 SDtfs, 10653 SDslu, 22109 SDs, 0 SdLazy, 8589 SolverSat, 514 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 90 SyntacticMatches, 29 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71010occurred 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: 13.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 76845 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2402 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 516307 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...