./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.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_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/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 4b58e06e0ff3c6a470a6b0069b0c1a47cdc822d5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:14:05,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:14:05,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:14:05,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:14:05,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:14:05,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:14:05,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:14:05,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:14:05,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:14:05,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:14:05,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:14:05,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:14:05,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:14:05,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:14:05,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:14:05,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:14:05,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:14:05,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:14:05,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:14:05,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:14:05,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:14:05,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:14:05,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:14:05,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:14:05,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:14:05,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:14:05,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:14:05,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:14:05,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:14:05,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:14:05,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:14:05,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:14:05,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:14:05,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:14:05,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:14:05,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:14:05,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:14:05,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:14:05,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:14:05,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:14:05,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:14:05,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:14:05,483 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:14:05,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:14:05,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:14:05,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:14:05,485 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:14:05,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:14:05,485 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:14:05,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:14:05,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:14:05,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:14:05,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:14:05,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:14:05,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:14:05,487 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:14:05,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:14:05,487 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:14:05,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:14:05,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:14:05,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:14:05,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:14:05,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:14:05,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:14:05,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:14:05,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:14:05,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:14:05,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:14:05,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:14:05,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:14:05,490 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_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/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 -> 4b58e06e0ff3c6a470a6b0069b0c1a47cdc822d5 [2019-11-15 23:14:05,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:14:05,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:14:05,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:14:05,542 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:14:05,542 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:14:05,543 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_tso.opt.i [2019-11-15 23:14:05,602 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/data/eb2baecd2/d7921b23eaa340768839b7d492c36fe9/FLAGb1f2d0b31 [2019-11-15 23:14:06,064 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:14:06,067 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/sv-benchmarks/c/pthread-wmm/rfi008_tso.opt.i [2019-11-15 23:14:06,091 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/data/eb2baecd2/d7921b23eaa340768839b7d492c36fe9/FLAGb1f2d0b31 [2019-11-15 23:14:06,318 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/data/eb2baecd2/d7921b23eaa340768839b7d492c36fe9 [2019-11-15 23:14:06,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:14:06,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:14:06,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:14:06,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:14:06,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:14:06,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:14:06" (1/1) ... [2019-11-15 23:14:06,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561d113f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:06, skipping insertion in model container [2019-11-15 23:14:06,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:14:06" (1/1) ... [2019-11-15 23:14:06,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:14:06,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:14:06,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:14:06,943 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:14:07,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:14:07,083 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:14:07,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07 WrapperNode [2019-11-15 23:14:07,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:14:07,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:14:07,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:14:07,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:14:07,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:14:07,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:14:07,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:14:07,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:14:07,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... [2019-11-15 23:14:07,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:14:07,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:14:07,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:14:07,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:14:07,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:14:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:14:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:14:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:14:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:14:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:14:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:14:07,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:14:07,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:14:07,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:14:07,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:14:07,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:14:07,270 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:14:08,041 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:14:08,041 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:14:08,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:08 BoogieIcfgContainer [2019-11-15 23:14:08,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:14:08,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:14:08,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:14:08,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:14:08,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:14:06" (1/3) ... [2019-11-15 23:14:08,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0ead54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:14:08, skipping insertion in model container [2019-11-15 23:14:08,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:07" (2/3) ... [2019-11-15 23:14:08,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0ead54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:14:08, skipping insertion in model container [2019-11-15 23:14:08,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:08" (3/3) ... [2019-11-15 23:14:08,052 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_tso.opt.i [2019-11-15 23:14:08,117 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,117 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,118 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,118 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,118 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,119 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,121 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,121 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,121 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,121 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,121 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,121 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,122 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,122 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,122 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,122 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,126 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,126 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,126 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,127 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,127 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,128 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,128 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,129 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,130 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,131 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,131 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,132 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,132 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,132 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,133 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,133 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,133 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,133 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,133 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,133 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,134 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,134 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,134 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,135 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,135 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,135 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,135 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,136 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,136 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,136 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,136 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,137 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,137 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,137 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,137 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,138 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,138 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,138 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,138 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,138 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,139 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,139 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,139 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,139 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,139 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,140 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,140 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,140 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,140 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,140 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,141 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,141 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,141 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,141 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,142 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,142 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,149 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,149 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,149 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,149 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,149 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,150 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,150 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,153 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,155 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,155 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,155 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,155 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,155 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,155 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,156 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,156 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,156 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,157 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,157 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,164 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,164 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,175 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,175 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,176 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,176 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,176 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,176 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,176 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,177 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,178 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,178 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,182 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,182 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,182 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,184 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,184 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,184 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,184 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,184 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,184 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,185 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,185 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,185 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,185 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:14:08,191 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:14:08,191 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:14:08,203 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:14:08,214 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:14:08,239 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:14:08,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:14:08,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:14:08,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:14:08,240 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:14:08,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:14:08,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:14:08,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:14:08,258 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 172 places, 225 transitions [2019-11-15 23:14:15,997 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80072 states. [2019-11-15 23:14:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 80072 states. [2019-11-15 23:14:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:14:16,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:16,010 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] [2019-11-15 23:14:16,012 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:16,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash -604827726, now seen corresponding path program 1 times [2019-11-15 23:14:16,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:16,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775663788] [2019-11-15 23:14:16,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:16,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:16,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:16,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775663788] [2019-11-15 23:14:16,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:16,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:14:16,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827046313] [2019-11-15 23:14:16,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:16,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:16,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:16,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:16,307 INFO L87 Difference]: Start difference. First operand 80072 states. Second operand 4 states. [2019-11-15 23:14:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:17,535 INFO L93 Difference]: Finished difference Result 80712 states and 324637 transitions. [2019-11-15 23:14:17,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:17,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-15 23:14:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:18,012 INFO L225 Difference]: With dead ends: 80712 [2019-11-15 23:14:18,012 INFO L226 Difference]: Without dead ends: 59000 [2019-11-15 23:14:18,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59000 states. [2019-11-15 23:14:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59000 to 59000. [2019-11-15 23:14:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59000 states. [2019-11-15 23:14:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59000 states to 59000 states and 240125 transitions. [2019-11-15 23:14:21,213 INFO L78 Accepts]: Start accepts. Automaton has 59000 states and 240125 transitions. Word has length 39 [2019-11-15 23:14:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:21,214 INFO L462 AbstractCegarLoop]: Abstraction has 59000 states and 240125 transitions. [2019-11-15 23:14:21,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 59000 states and 240125 transitions. [2019-11-15 23:14:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:14:21,224 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:21,224 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-15 23:14:21,225 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:21,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1443424259, now seen corresponding path program 1 times [2019-11-15 23:14:21,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:21,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555666945] [2019-11-15 23:14:21,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:21,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:21,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:21,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555666945] [2019-11-15 23:14:21,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:21,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:14:21,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287384605] [2019-11-15 23:14:21,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:14:21,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:21,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:14:21,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:21,335 INFO L87 Difference]: Start difference. First operand 59000 states and 240125 transitions. Second operand 5 states. [2019-11-15 23:14:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:22,467 INFO L93 Difference]: Finished difference Result 95594 states and 363716 transitions. [2019-11-15 23:14:22,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:14:22,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 23:14:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:22,798 INFO L225 Difference]: With dead ends: 95594 [2019-11-15 23:14:22,798 INFO L226 Difference]: Without dead ends: 95042 [2019-11-15 23:14:22,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:14:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2019-11-15 23:14:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 93164. [2019-11-15 23:14:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93164 states. [2019-11-15 23:14:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93164 states to 93164 states and 356302 transitions. [2019-11-15 23:14:31,499 INFO L78 Accepts]: Start accepts. Automaton has 93164 states and 356302 transitions. Word has length 47 [2019-11-15 23:14:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:31,500 INFO L462 AbstractCegarLoop]: Abstraction has 93164 states and 356302 transitions. [2019-11-15 23:14:31,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:14:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 93164 states and 356302 transitions. [2019-11-15 23:14:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:14:31,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:31,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:31,506 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:31,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:31,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1685347279, now seen corresponding path program 1 times [2019-11-15 23:14:31,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:31,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067030802] [2019-11-15 23:14:31,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:31,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:31,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:31,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067030802] [2019-11-15 23:14:31,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:31,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:14:31,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677218207] [2019-11-15 23:14:31,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:14:31,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:14:31,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:31,606 INFO L87 Difference]: Start difference. First operand 93164 states and 356302 transitions. Second operand 5 states. [2019-11-15 23:14:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:32,596 INFO L93 Difference]: Finished difference Result 118508 states and 442883 transitions. [2019-11-15 23:14:32,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:14:32,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 23:14:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:32,992 INFO L225 Difference]: With dead ends: 118508 [2019-11-15 23:14:32,992 INFO L226 Difference]: Without dead ends: 118060 [2019-11-15 23:14:32,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:14:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118060 states. [2019-11-15 23:14:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118060 to 104153. [2019-11-15 23:14:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104153 states. [2019-11-15 23:14:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104153 states to 104153 states and 394236 transitions. [2019-11-15 23:14:37,141 INFO L78 Accepts]: Start accepts. Automaton has 104153 states and 394236 transitions. Word has length 48 [2019-11-15 23:14:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:37,142 INFO L462 AbstractCegarLoop]: Abstraction has 104153 states and 394236 transitions. [2019-11-15 23:14:37,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:14:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 104153 states and 394236 transitions. [2019-11-15 23:14:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:14:37,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:37,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:37,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1299597237, now seen corresponding path program 1 times [2019-11-15 23:14:37,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:37,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845352247] [2019-11-15 23:14:37,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:37,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:37,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:37,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845352247] [2019-11-15 23:14:37,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:37,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:37,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278967982] [2019-11-15 23:14:37,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:37,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:37,237 INFO L87 Difference]: Start difference. First operand 104153 states and 394236 transitions. Second operand 3 states. [2019-11-15 23:14:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:38,008 INFO L93 Difference]: Finished difference Result 170911 states and 627058 transitions. [2019-11-15 23:14:38,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:38,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 23:14:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:38,391 INFO L225 Difference]: With dead ends: 170911 [2019-11-15 23:14:38,392 INFO L226 Difference]: Without dead ends: 170911 [2019-11-15 23:14:38,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170911 states. [2019-11-15 23:14:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170911 to 157189. [2019-11-15 23:14:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157189 states. [2019-11-15 23:14:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157189 states to 157189 states and 581290 transitions. [2019-11-15 23:14:43,655 INFO L78 Accepts]: Start accepts. Automaton has 157189 states and 581290 transitions. Word has length 50 [2019-11-15 23:14:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:43,655 INFO L462 AbstractCegarLoop]: Abstraction has 157189 states and 581290 transitions. [2019-11-15 23:14:43,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 157189 states and 581290 transitions. [2019-11-15 23:14:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:14:43,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:43,682 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] [2019-11-15 23:14:43,682 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1671465856, now seen corresponding path program 1 times [2019-11-15 23:14:43,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:43,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905584470] [2019-11-15 23:14:43,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:43,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:43,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:43,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905584470] [2019-11-15 23:14:43,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:43,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:14:43,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326099951] [2019-11-15 23:14:43,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:14:43,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:43,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:14:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:14:43,786 INFO L87 Difference]: Start difference. First operand 157189 states and 581290 transitions. Second operand 6 states. [2019-11-15 23:14:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:51,256 INFO L93 Difference]: Finished difference Result 212573 states and 766172 transitions. [2019-11-15 23:14:51,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:14:51,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:14:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:51,749 INFO L225 Difference]: With dead ends: 212573 [2019-11-15 23:14:51,749 INFO L226 Difference]: Without dead ends: 212053 [2019-11-15 23:14:51,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:14:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212053 states. [2019-11-15 23:14:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212053 to 157971. [2019-11-15 23:14:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157971 states. [2019-11-15 23:14:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157971 states to 157971 states and 584227 transitions. [2019-11-15 23:14:56,859 INFO L78 Accepts]: Start accepts. Automaton has 157971 states and 584227 transitions. Word has length 54 [2019-11-15 23:14:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:56,859 INFO L462 AbstractCegarLoop]: Abstraction has 157971 states and 584227 transitions. [2019-11-15 23:14:56,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:14:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 157971 states and 584227 transitions. [2019-11-15 23:14:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:14:56,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:56,877 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] [2019-11-15 23:14:56,877 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:56,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1359982475, now seen corresponding path program 1 times [2019-11-15 23:14:56,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:56,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638447370] [2019-11-15 23:14:56,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:56,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:56,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:57,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638447370] [2019-11-15 23:14:57,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:57,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:14:57,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587190913] [2019-11-15 23:14:57,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:14:57,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:14:57,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:14:57,006 INFO L87 Difference]: Start difference. First operand 157971 states and 584227 transitions. Second operand 6 states. [2019-11-15 23:14:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:58,603 INFO L93 Difference]: Finished difference Result 208198 states and 766451 transitions. [2019-11-15 23:14:58,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:14:58,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:14:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:59,121 INFO L225 Difference]: With dead ends: 208198 [2019-11-15 23:14:59,121 INFO L226 Difference]: Without dead ends: 208198 [2019-11-15 23:14:59,122 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-15 23:15:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208198 states. [2019-11-15 23:15:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208198 to 193994. [2019-11-15 23:15:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193994 states. [2019-11-15 23:15:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193994 states to 193994 states and 714235 transitions. [2019-11-15 23:15:05,779 INFO L78 Accepts]: Start accepts. Automaton has 193994 states and 714235 transitions. Word has length 54 [2019-11-15 23:15:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:05,780 INFO L462 AbstractCegarLoop]: Abstraction has 193994 states and 714235 transitions. [2019-11-15 23:15:05,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:15:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 193994 states and 714235 transitions. [2019-11-15 23:15:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:15:05,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:05,804 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] [2019-11-15 23:15:05,804 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:05,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:05,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1138033462, now seen corresponding path program 1 times [2019-11-15 23:15:05,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:05,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898723038] [2019-11-15 23:15:05,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:05,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:05,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:05,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898723038] [2019-11-15 23:15:05,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:05,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:15:05,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831620834] [2019-11-15 23:15:05,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:15:05,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:05,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:15:05,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:05,959 INFO L87 Difference]: Start difference. First operand 193994 states and 714235 transitions. Second operand 7 states. [2019-11-15 23:15:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:09,491 INFO L93 Difference]: Finished difference Result 277137 states and 986575 transitions. [2019-11-15 23:15:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:15:09,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 23:15:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:10,138 INFO L225 Difference]: With dead ends: 277137 [2019-11-15 23:15:10,138 INFO L226 Difference]: Without dead ends: 277137 [2019-11-15 23:15:10,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:15:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277137 states. [2019-11-15 23:15:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277137 to 222093. [2019-11-15 23:15:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222093 states. [2019-11-15 23:15:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222093 states to 222093 states and 805379 transitions. [2019-11-15 23:15:25,477 INFO L78 Accepts]: Start accepts. Automaton has 222093 states and 805379 transitions. Word has length 54 [2019-11-15 23:15:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:25,478 INFO L462 AbstractCegarLoop]: Abstraction has 222093 states and 805379 transitions. [2019-11-15 23:15:25,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:15:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 222093 states and 805379 transitions. [2019-11-15 23:15:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:15:25,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:25,505 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] [2019-11-15 23:15:25,506 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2025537143, now seen corresponding path program 1 times [2019-11-15 23:15:25,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:25,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609783855] [2019-11-15 23:15:25,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:25,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:25,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:25,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609783855] [2019-11-15 23:15:25,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:25,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:15:25,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856164741] [2019-11-15 23:15:25,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:15:25,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:25,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:15:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:15:25,602 INFO L87 Difference]: Start difference. First operand 222093 states and 805379 transitions. Second operand 4 states. [2019-11-15 23:15:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:25,772 INFO L93 Difference]: Finished difference Result 31666 states and 98776 transitions. [2019-11-15 23:15:25,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:15:25,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 23:15:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:25,829 INFO L225 Difference]: With dead ends: 31666 [2019-11-15 23:15:25,830 INFO L226 Difference]: Without dead ends: 25368 [2019-11-15 23:15:25,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:15:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25368 states. [2019-11-15 23:15:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25368 to 25121. [2019-11-15 23:15:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25121 states. [2019-11-15 23:15:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25121 states to 25121 states and 76285 transitions. [2019-11-15 23:15:26,220 INFO L78 Accepts]: Start accepts. Automaton has 25121 states and 76285 transitions. Word has length 54 [2019-11-15 23:15:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:26,220 INFO L462 AbstractCegarLoop]: Abstraction has 25121 states and 76285 transitions. [2019-11-15 23:15:26,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:15:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25121 states and 76285 transitions. [2019-11-15 23:15:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:15:26,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:26,227 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:26,227 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:26,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:26,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1312308556, now seen corresponding path program 1 times [2019-11-15 23:15:26,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:26,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647216057] [2019-11-15 23:15:26,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:26,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:26,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:26,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647216057] [2019-11-15 23:15:26,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:26,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:15:26,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965032343] [2019-11-15 23:15:26,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:15:26,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:15:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:15:26,288 INFO L87 Difference]: Start difference. First operand 25121 states and 76285 transitions. Second operand 4 states. [2019-11-15 23:15:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:26,553 INFO L93 Difference]: Finished difference Result 32379 states and 99236 transitions. [2019-11-15 23:15:26,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:15:26,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 23:15:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:26,603 INFO L225 Difference]: With dead ends: 32379 [2019-11-15 23:15:26,603 INFO L226 Difference]: Without dead ends: 32379 [2019-11-15 23:15:26,603 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-15 23:15:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32379 states. [2019-11-15 23:15:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32379 to 28488. [2019-11-15 23:15:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28488 states. [2019-11-15 23:15:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28488 states to 28488 states and 86775 transitions. [2019-11-15 23:15:27,042 INFO L78 Accepts]: Start accepts. Automaton has 28488 states and 86775 transitions. Word has length 64 [2019-11-15 23:15:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:27,042 INFO L462 AbstractCegarLoop]: Abstraction has 28488 states and 86775 transitions. [2019-11-15 23:15:27,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:15:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 28488 states and 86775 transitions. [2019-11-15 23:15:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:15:27,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:27,051 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:27,051 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:27,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1239848405, now seen corresponding path program 1 times [2019-11-15 23:15:27,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:27,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414465990] [2019-11-15 23:15:27,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:27,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:27,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:27,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414465990] [2019-11-15 23:15:27,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:27,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:15:27,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102666706] [2019-11-15 23:15:27,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:15:27,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:27,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:15:27,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:15:27,129 INFO L87 Difference]: Start difference. First operand 28488 states and 86775 transitions. Second operand 6 states. [2019-11-15 23:15:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:27,835 INFO L93 Difference]: Finished difference Result 38566 states and 114981 transitions. [2019-11-15 23:15:27,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:15:27,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-15 23:15:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:27,892 INFO L225 Difference]: With dead ends: 38566 [2019-11-15 23:15:27,892 INFO L226 Difference]: Without dead ends: 38518 [2019-11-15 23:15:27,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:15:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38518 states. [2019-11-15 23:15:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38518 to 32517. [2019-11-15 23:15:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32517 states. [2019-11-15 23:15:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32517 states to 32517 states and 97747 transitions. [2019-11-15 23:15:28,430 INFO L78 Accepts]: Start accepts. Automaton has 32517 states and 97747 transitions. Word has length 64 [2019-11-15 23:15:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:28,430 INFO L462 AbstractCegarLoop]: Abstraction has 32517 states and 97747 transitions. [2019-11-15 23:15:28,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:15:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32517 states and 97747 transitions. [2019-11-15 23:15:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:15:28,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:28,446 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:28,446 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash -763750436, now seen corresponding path program 1 times [2019-11-15 23:15:28,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:28,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467108865] [2019-11-15 23:15:28,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:28,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:28,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:28,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467108865] [2019-11-15 23:15:28,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:28,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:15:28,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81586807] [2019-11-15 23:15:28,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:15:28,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:15:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:15:28,497 INFO L87 Difference]: Start difference. First operand 32517 states and 97747 transitions. Second operand 3 states. [2019-11-15 23:15:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:28,683 INFO L93 Difference]: Finished difference Result 36901 states and 109184 transitions. [2019-11-15 23:15:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:15:28,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-15 23:15:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:28,744 INFO L225 Difference]: With dead ends: 36901 [2019-11-15 23:15:28,744 INFO L226 Difference]: Without dead ends: 36901 [2019-11-15 23:15:28,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:15:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36901 states. [2019-11-15 23:15:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36901 to 32227. [2019-11-15 23:15:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-11-15 23:15:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 94698 transitions. [2019-11-15 23:15:29,248 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 94698 transitions. Word has length 70 [2019-11-15 23:15:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:29,248 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 94698 transitions. [2019-11-15 23:15:29,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:15:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 94698 transitions. [2019-11-15 23:15:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:15:29,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:29,258 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-15 23:15:29,259 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1211178936, now seen corresponding path program 1 times [2019-11-15 23:15:29,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:29,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48544431] [2019-11-15 23:15:29,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:29,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:29,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:29,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48544431] [2019-11-15 23:15:29,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:29,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:15:29,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698627111] [2019-11-15 23:15:29,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:15:29,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:29,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:15:29,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:29,356 INFO L87 Difference]: Start difference. First operand 32227 states and 94698 transitions. Second operand 7 states. [2019-11-15 23:15:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:31,558 INFO L93 Difference]: Finished difference Result 44458 states and 130306 transitions. [2019-11-15 23:15:31,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:15:31,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-11-15 23:15:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:31,619 INFO L225 Difference]: With dead ends: 44458 [2019-11-15 23:15:31,619 INFO L226 Difference]: Without dead ends: 44245 [2019-11-15 23:15:31,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:15:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44245 states. [2019-11-15 23:15:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44245 to 37608. [2019-11-15 23:15:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37608 states. [2019-11-15 23:15:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37608 states to 37608 states and 110222 transitions. [2019-11-15 23:15:32,129 INFO L78 Accepts]: Start accepts. Automaton has 37608 states and 110222 transitions. Word has length 71 [2019-11-15 23:15:32,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:32,130 INFO L462 AbstractCegarLoop]: Abstraction has 37608 states and 110222 transitions. [2019-11-15 23:15:32,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:15:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 37608 states and 110222 transitions. [2019-11-15 23:15:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:15:32,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:32,142 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-15 23:15:32,142 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:32,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1286837001, now seen corresponding path program 1 times [2019-11-15 23:15:32,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:32,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391246594] [2019-11-15 23:15:32,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:32,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:32,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:32,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391246594] [2019-11-15 23:15:32,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:32,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:15:32,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793690606] [2019-11-15 23:15:32,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:15:32,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:32,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:15:32,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:15:32,236 INFO L87 Difference]: Start difference. First operand 37608 states and 110222 transitions. Second operand 8 states. [2019-11-15 23:15:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:33,299 INFO L93 Difference]: Finished difference Result 45174 states and 130617 transitions. [2019-11-15 23:15:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:15:33,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-11-15 23:15:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:33,355 INFO L225 Difference]: With dead ends: 45174 [2019-11-15 23:15:33,355 INFO L226 Difference]: Without dead ends: 45174 [2019-11-15 23:15:33,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:15:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45174 states. [2019-11-15 23:15:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45174 to 39735. [2019-11-15 23:15:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39735 states. [2019-11-15 23:15:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39735 states to 39735 states and 115957 transitions. [2019-11-15 23:15:33,894 INFO L78 Accepts]: Start accepts. Automaton has 39735 states and 115957 transitions. Word has length 71 [2019-11-15 23:15:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:33,894 INFO L462 AbstractCegarLoop]: Abstraction has 39735 states and 115957 transitions. [2019-11-15 23:15:33,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:15:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 39735 states and 115957 transitions. [2019-11-15 23:15:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:15:33,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:33,907 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-15 23:15:33,907 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:33,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2120626614, now seen corresponding path program 1 times [2019-11-15 23:15:33,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:33,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481160912] [2019-11-15 23:15:33,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:33,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:33,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:33,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-15 23:15:33,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481160912] [2019-11-15 23:15:33,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:33,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:15:33,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868948357] [2019-11-15 23:15:33,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:15:33,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:33,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:15:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:15:33,981 INFO L87 Difference]: Start difference. First operand 39735 states and 115957 transitions. Second operand 5 states. [2019-11-15 23:15:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:34,052 INFO L93 Difference]: Finished difference Result 11760 states and 29081 transitions. [2019-11-15 23:15:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:15:34,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-15 23:15:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:34,065 INFO L225 Difference]: With dead ends: 11760 [2019-11-15 23:15:34,065 INFO L226 Difference]: Without dead ends: 10182 [2019-11-15 23:15:34,066 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-15 23:15:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10182 states. [2019-11-15 23:15:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 7787. [2019-11-15 23:15:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7787 states. [2019-11-15 23:15:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 19326 transitions. [2019-11-15 23:15:34,200 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 19326 transitions. Word has length 71 [2019-11-15 23:15:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:34,200 INFO L462 AbstractCegarLoop]: Abstraction has 7787 states and 19326 transitions. [2019-11-15 23:15:34,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:15:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 19326 transitions. [2019-11-15 23:15:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:15:34,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:34,210 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:34,210 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:34,210 INFO L82 PathProgramCache]: Analyzing trace with hash -140658983, now seen corresponding path program 1 times [2019-11-15 23:15:34,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:34,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039618311] [2019-11-15 23:15:34,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:34,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:34,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:34,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039618311] [2019-11-15 23:15:34,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:34,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:15:34,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784072186] [2019-11-15 23:15:34,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:15:34,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:15:34,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:15:34,293 INFO L87 Difference]: Start difference. First operand 7787 states and 19326 transitions. Second operand 4 states. [2019-11-15 23:15:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:34,535 INFO L93 Difference]: Finished difference Result 8975 states and 21903 transitions. [2019-11-15 23:15:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:15:34,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 23:15:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:34,546 INFO L225 Difference]: With dead ends: 8975 [2019-11-15 23:15:34,546 INFO L226 Difference]: Without dead ends: 8975 [2019-11-15 23:15:34,548 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-15 23:15:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8975 states. [2019-11-15 23:15:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8975 to 8567. [2019-11-15 23:15:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8567 states. [2019-11-15 23:15:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 21023 transitions. [2019-11-15 23:15:34,663 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 21023 transitions. Word has length 99 [2019-11-15 23:15:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:34,664 INFO L462 AbstractCegarLoop]: Abstraction has 8567 states and 21023 transitions. [2019-11-15 23:15:34,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:15:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 21023 transitions. [2019-11-15 23:15:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:15:34,672 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:34,672 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:34,672 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2077098970, now seen corresponding path program 1 times [2019-11-15 23:15:34,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:34,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655818375] [2019-11-15 23:15:34,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:34,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:34,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:34,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655818375] [2019-11-15 23:15:34,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:34,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:15:34,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120747372] [2019-11-15 23:15:34,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:15:34,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:34,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:15:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:15:34,717 INFO L87 Difference]: Start difference. First operand 8567 states and 21023 transitions. Second operand 3 states. [2019-11-15 23:15:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:34,966 INFO L93 Difference]: Finished difference Result 11773 states and 28443 transitions. [2019-11-15 23:15:34,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:15:34,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 23:15:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:34,980 INFO L225 Difference]: With dead ends: 11773 [2019-11-15 23:15:34,980 INFO L226 Difference]: Without dead ends: 11773 [2019-11-15 23:15:34,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:15:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11773 states. [2019-11-15 23:15:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11773 to 10613. [2019-11-15 23:15:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10613 states. [2019-11-15 23:15:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10613 states to 10613 states and 25857 transitions. [2019-11-15 23:15:35,115 INFO L78 Accepts]: Start accepts. Automaton has 10613 states and 25857 transitions. Word has length 99 [2019-11-15 23:15:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:35,115 INFO L462 AbstractCegarLoop]: Abstraction has 10613 states and 25857 transitions. [2019-11-15 23:15:35,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:15:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 10613 states and 25857 transitions. [2019-11-15 23:15:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:15:35,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:35,126 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:35,126 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:35,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1056240900, now seen corresponding path program 2 times [2019-11-15 23:15:35,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:35,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433320893] [2019-11-15 23:15:35,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:35,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:35,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:35,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433320893] [2019-11-15 23:15:35,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:35,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:15:35,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920295798] [2019-11-15 23:15:35,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:15:35,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:35,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:15:35,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:15:35,210 INFO L87 Difference]: Start difference. First operand 10613 states and 25857 transitions. Second operand 6 states. [2019-11-15 23:15:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:35,756 INFO L93 Difference]: Finished difference Result 13121 states and 31325 transitions. [2019-11-15 23:15:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:15:35,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 23:15:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:35,768 INFO L225 Difference]: With dead ends: 13121 [2019-11-15 23:15:35,768 INFO L226 Difference]: Without dead ends: 13121 [2019-11-15 23:15:35,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:15:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-11-15 23:15:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 10392. [2019-11-15 23:15:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10392 states. [2019-11-15 23:15:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10392 states to 10392 states and 24873 transitions. [2019-11-15 23:15:36,044 INFO L78 Accepts]: Start accepts. Automaton has 10392 states and 24873 transitions. Word has length 99 [2019-11-15 23:15:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:36,044 INFO L462 AbstractCegarLoop]: Abstraction has 10392 states and 24873 transitions. [2019-11-15 23:15:36,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:15:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 10392 states and 24873 transitions. [2019-11-15 23:15:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 23:15:36,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:36,052 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:36,053 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:36,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2095399974, now seen corresponding path program 1 times [2019-11-15 23:15:36,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:36,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326355803] [2019-11-15 23:15:36,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:36,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:36,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:36,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326355803] [2019-11-15 23:15:36,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:36,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:15:36,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799905288] [2019-11-15 23:15:36,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:15:36,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:15:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:15:36,218 INFO L87 Difference]: Start difference. First operand 10392 states and 24873 transitions. Second operand 8 states. [2019-11-15 23:15:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:36,776 INFO L93 Difference]: Finished difference Result 14294 states and 34316 transitions. [2019-11-15 23:15:36,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:15:36,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-11-15 23:15:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:36,789 INFO L225 Difference]: With dead ends: 14294 [2019-11-15 23:15:36,790 INFO L226 Difference]: Without dead ends: 14276 [2019-11-15 23:15:36,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:15:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14276 states. [2019-11-15 23:15:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14276 to 11945. [2019-11-15 23:15:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11945 states. [2019-11-15 23:15:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11945 states to 11945 states and 28747 transitions. [2019-11-15 23:15:36,935 INFO L78 Accepts]: Start accepts. Automaton has 11945 states and 28747 transitions. Word has length 101 [2019-11-15 23:15:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:36,936 INFO L462 AbstractCegarLoop]: Abstraction has 11945 states and 28747 transitions. [2019-11-15 23:15:36,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:15:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11945 states and 28747 transitions. [2019-11-15 23:15:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 23:15:36,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:36,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:36,945 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash 402615963, now seen corresponding path program 1 times [2019-11-15 23:15:36,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:36,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128262891] [2019-11-15 23:15:36,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:36,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:36,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:37,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128262891] [2019-11-15 23:15:37,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:37,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:15:37,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073528279] [2019-11-15 23:15:37,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:15:37,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:37,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:15:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:37,037 INFO L87 Difference]: Start difference. First operand 11945 states and 28747 transitions. Second operand 7 states. [2019-11-15 23:15:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:37,614 INFO L93 Difference]: Finished difference Result 15768 states and 37772 transitions. [2019-11-15 23:15:37,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:15:37,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-11-15 23:15:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:37,628 INFO L225 Difference]: With dead ends: 15768 [2019-11-15 23:15:37,628 INFO L226 Difference]: Without dead ends: 15768 [2019-11-15 23:15:37,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:15:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15768 states. [2019-11-15 23:15:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15768 to 12323. [2019-11-15 23:15:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12323 states. [2019-11-15 23:15:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12323 states to 12323 states and 29732 transitions. [2019-11-15 23:15:37,805 INFO L78 Accepts]: Start accepts. Automaton has 12323 states and 29732 transitions. Word has length 101 [2019-11-15 23:15:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:37,806 INFO L462 AbstractCegarLoop]: Abstraction has 12323 states and 29732 transitions. [2019-11-15 23:15:37,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:15:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12323 states and 29732 transitions. [2019-11-15 23:15:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 23:15:37,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:37,818 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:37,818 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1290119644, now seen corresponding path program 1 times [2019-11-15 23:15:37,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:37,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654926083] [2019-11-15 23:15:37,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:37,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:37,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:37,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654926083] [2019-11-15 23:15:37,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:37,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:15:37,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318747808] [2019-11-15 23:15:37,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:15:37,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:15:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:37,952 INFO L87 Difference]: Start difference. First operand 12323 states and 29732 transitions. Second operand 7 states. [2019-11-15 23:15:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:38,167 INFO L93 Difference]: Finished difference Result 14997 states and 36113 transitions. [2019-11-15 23:15:38,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:15:38,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-11-15 23:15:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:38,187 INFO L225 Difference]: With dead ends: 14997 [2019-11-15 23:15:38,187 INFO L226 Difference]: Without dead ends: 14997 [2019-11-15 23:15:38,187 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:15:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14997 states. [2019-11-15 23:15:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14997 to 12887. [2019-11-15 23:15:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12887 states. [2019-11-15 23:15:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12887 states to 12887 states and 31177 transitions. [2019-11-15 23:15:38,350 INFO L78 Accepts]: Start accepts. Automaton has 12887 states and 31177 transitions. Word has length 101 [2019-11-15 23:15:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:38,351 INFO L462 AbstractCegarLoop]: Abstraction has 12887 states and 31177 transitions. [2019-11-15 23:15:38,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:15:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12887 states and 31177 transitions. [2019-11-15 23:15:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 23:15:38,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:38,362 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:38,362 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:38,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:38,363 INFO L82 PathProgramCache]: Analyzing trace with hash 46286492, now seen corresponding path program 1 times [2019-11-15 23:15:38,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:38,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792609570] [2019-11-15 23:15:38,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:38,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:38,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:38,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792609570] [2019-11-15 23:15:38,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:38,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:15:38,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815337938] [2019-11-15 23:15:38,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:15:38,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:38,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:15:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:15:38,492 INFO L87 Difference]: Start difference. First operand 12887 states and 31177 transitions. Second operand 6 states. [2019-11-15 23:15:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:38,699 INFO L93 Difference]: Finished difference Result 12734 states and 30667 transitions. [2019-11-15 23:15:38,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:15:38,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-15 23:15:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:38,712 INFO L225 Difference]: With dead ends: 12734 [2019-11-15 23:15:38,712 INFO L226 Difference]: Without dead ends: 12734 [2019-11-15 23:15:38,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:15:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12734 states. [2019-11-15 23:15:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12734 to 10831. [2019-11-15 23:15:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10831 states. [2019-11-15 23:15:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10831 states to 10831 states and 26338 transitions. [2019-11-15 23:15:38,861 INFO L78 Accepts]: Start accepts. Automaton has 10831 states and 26338 transitions. Word has length 101 [2019-11-15 23:15:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:38,861 INFO L462 AbstractCegarLoop]: Abstraction has 10831 states and 26338 transitions. [2019-11-15 23:15:38,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:15:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 10831 states and 26338 transitions. [2019-11-15 23:15:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 23:15:38,871 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:38,871 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:38,872 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1164531572, now seen corresponding path program 1 times [2019-11-15 23:15:38,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:38,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463238423] [2019-11-15 23:15:38,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:38,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:38,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:38,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463238423] [2019-11-15 23:15:38,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:38,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:15:38,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280517420] [2019-11-15 23:15:38,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:15:38,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:38,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:15:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:15:38,954 INFO L87 Difference]: Start difference. First operand 10831 states and 26338 transitions. Second operand 5 states. [2019-11-15 23:15:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:39,274 INFO L93 Difference]: Finished difference Result 12545 states and 29916 transitions. [2019-11-15 23:15:39,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:15:39,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-11-15 23:15:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:39,287 INFO L225 Difference]: With dead ends: 12545 [2019-11-15 23:15:39,287 INFO L226 Difference]: Without dead ends: 12545 [2019-11-15 23:15:39,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states. [2019-11-15 23:15:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 10989. [2019-11-15 23:15:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10989 states. [2019-11-15 23:15:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10989 states to 10989 states and 26676 transitions. [2019-11-15 23:15:39,420 INFO L78 Accepts]: Start accepts. Automaton has 10989 states and 26676 transitions. Word has length 101 [2019-11-15 23:15:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:39,421 INFO L462 AbstractCegarLoop]: Abstraction has 10989 states and 26676 transitions. [2019-11-15 23:15:39,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:15:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 10989 states and 26676 transitions. [2019-11-15 23:15:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:15:39,430 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:39,430 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:39,431 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash 416443369, now seen corresponding path program 1 times [2019-11-15 23:15:39,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:39,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888997139] [2019-11-15 23:15:39,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:39,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:39,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:39,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888997139] [2019-11-15 23:15:39,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:39,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:15:39,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975149049] [2019-11-15 23:15:39,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:15:39,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:39,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:15:39,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:15:39,565 INFO L87 Difference]: Start difference. First operand 10989 states and 26676 transitions. Second operand 8 states. [2019-11-15 23:15:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:40,700 INFO L93 Difference]: Finished difference Result 17975 states and 42342 transitions. [2019-11-15 23:15:40,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:15:40,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-11-15 23:15:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:40,719 INFO L225 Difference]: With dead ends: 17975 [2019-11-15 23:15:40,720 INFO L226 Difference]: Without dead ends: 17884 [2019-11-15 23:15:40,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:15:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17884 states. [2019-11-15 23:15:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17884 to 13569. [2019-11-15 23:15:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13569 states. [2019-11-15 23:15:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13569 states to 13569 states and 32543 transitions. [2019-11-15 23:15:40,914 INFO L78 Accepts]: Start accepts. Automaton has 13569 states and 32543 transitions. Word has length 103 [2019-11-15 23:15:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:40,914 INFO L462 AbstractCegarLoop]: Abstraction has 13569 states and 32543 transitions. [2019-11-15 23:15:40,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:15:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 13569 states and 32543 transitions. [2019-11-15 23:15:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:15:40,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:40,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:40,927 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1660765974, now seen corresponding path program 1 times [2019-11-15 23:15:40,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:40,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842722408] [2019-11-15 23:15:40,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:40,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:40,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:41,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842722408] [2019-11-15 23:15:41,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:41,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:15:41,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217623606] [2019-11-15 23:15:41,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:15:41,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:41,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:15:41,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:41,086 INFO L87 Difference]: Start difference. First operand 13569 states and 32543 transitions. Second operand 7 states. [2019-11-15 23:15:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:41,721 INFO L93 Difference]: Finished difference Result 17288 states and 40148 transitions. [2019-11-15 23:15:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:15:41,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-11-15 23:15:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:41,736 INFO L225 Difference]: With dead ends: 17288 [2019-11-15 23:15:41,737 INFO L226 Difference]: Without dead ends: 17288 [2019-11-15 23:15:41,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:15:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17288 states. [2019-11-15 23:15:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17288 to 15137. [2019-11-15 23:15:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15137 states. [2019-11-15 23:15:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 35656 transitions. [2019-11-15 23:15:41,928 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 35656 transitions. Word has length 103 [2019-11-15 23:15:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:41,928 INFO L462 AbstractCegarLoop]: Abstraction has 15137 states and 35656 transitions. [2019-11-15 23:15:41,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:15:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 35656 transitions. [2019-11-15 23:15:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:15:41,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:41,941 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:41,942 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1449415061, now seen corresponding path program 1 times [2019-11-15 23:15:41,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:41,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873966144] [2019-11-15 23:15:41,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:41,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:41,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:42,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873966144] [2019-11-15 23:15:42,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:42,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:15:42,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150745270] [2019-11-15 23:15:42,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:15:42,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:42,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:15:42,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:42,073 INFO L87 Difference]: Start difference. First operand 15137 states and 35656 transitions. Second operand 7 states. [2019-11-15 23:15:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:42,444 INFO L93 Difference]: Finished difference Result 15658 states and 36750 transitions. [2019-11-15 23:15:42,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:15:42,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-11-15 23:15:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:42,461 INFO L225 Difference]: With dead ends: 15658 [2019-11-15 23:15:42,462 INFO L226 Difference]: Without dead ends: 15658 [2019-11-15 23:15:42,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:15:42,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15658 states. [2019-11-15 23:15:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15658 to 15537. [2019-11-15 23:15:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15537 states. [2019-11-15 23:15:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15537 states to 15537 states and 36514 transitions. [2019-11-15 23:15:42,761 INFO L78 Accepts]: Start accepts. Automaton has 15537 states and 36514 transitions. Word has length 103 [2019-11-15 23:15:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:42,761 INFO L462 AbstractCegarLoop]: Abstraction has 15537 states and 36514 transitions. [2019-11-15 23:15:42,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:15:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 15537 states and 36514 transitions. [2019-11-15 23:15:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:15:42,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:42,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:42,780 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:42,781 INFO L82 PathProgramCache]: Analyzing trace with hash -561911380, now seen corresponding path program 1 times [2019-11-15 23:15:42,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:42,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148081193] [2019-11-15 23:15:42,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:42,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:42,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:42,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148081193] [2019-11-15 23:15:42,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:42,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:15:42,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951167274] [2019-11-15 23:15:42,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:15:42,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:15:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:42,949 INFO L87 Difference]: Start difference. First operand 15537 states and 36514 transitions. Second operand 7 states. [2019-11-15 23:15:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:43,126 INFO L93 Difference]: Finished difference Result 18932 states and 44652 transitions. [2019-11-15 23:15:43,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:15:43,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-11-15 23:15:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:43,140 INFO L225 Difference]: With dead ends: 18932 [2019-11-15 23:15:43,141 INFO L226 Difference]: Without dead ends: 16626 [2019-11-15 23:15:43,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:15:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16626 states. [2019-11-15 23:15:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16626 to 13947. [2019-11-15 23:15:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13947 states. [2019-11-15 23:15:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13947 states to 13947 states and 32811 transitions. [2019-11-15 23:15:43,303 INFO L78 Accepts]: Start accepts. Automaton has 13947 states and 32811 transitions. Word has length 103 [2019-11-15 23:15:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:43,304 INFO L462 AbstractCegarLoop]: Abstraction has 13947 states and 32811 transitions. [2019-11-15 23:15:43,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:15:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 13947 states and 32811 transitions. [2019-11-15 23:15:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:15:43,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:43,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:43,315 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash -227042974, now seen corresponding path program 2 times [2019-11-15 23:15:43,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:43,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533965865] [2019-11-15 23:15:43,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:43,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:43,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:43,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533965865] [2019-11-15 23:15:43,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:43,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:15:43,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479517252] [2019-11-15 23:15:43,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:15:43,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:43,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:15:43,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:15:43,355 INFO L87 Difference]: Start difference. First operand 13947 states and 32811 transitions. Second operand 3 states. [2019-11-15 23:15:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:43,415 INFO L93 Difference]: Finished difference Result 16770 states and 39603 transitions. [2019-11-15 23:15:43,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:15:43,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 23:15:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:43,435 INFO L225 Difference]: With dead ends: 16770 [2019-11-15 23:15:43,435 INFO L226 Difference]: Without dead ends: 16770 [2019-11-15 23:15:43,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:15:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16770 states. [2019-11-15 23:15:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16770 to 16698. [2019-11-15 23:15:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16698 states. [2019-11-15 23:15:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16698 states to 16698 states and 39440 transitions. [2019-11-15 23:15:43,673 INFO L78 Accepts]: Start accepts. Automaton has 16698 states and 39440 transitions. Word has length 103 [2019-11-15 23:15:43,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:43,674 INFO L462 AbstractCegarLoop]: Abstraction has 16698 states and 39440 transitions. [2019-11-15 23:15:43,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:15:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 16698 states and 39440 transitions. [2019-11-15 23:15:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:15:43,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:43,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:43,692 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash 123756963, now seen corresponding path program 1 times [2019-11-15 23:15:43,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:43,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681317120] [2019-11-15 23:15:43,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:43,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:43,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:15:43,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681317120] [2019-11-15 23:15:43,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:43,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:15:43,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842088477] [2019-11-15 23:15:43,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:15:43,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:15:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:43,809 INFO L87 Difference]: Start difference. First operand 16698 states and 39440 transitions. Second operand 7 states. [2019-11-15 23:15:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:43,939 INFO L93 Difference]: Finished difference Result 17247 states and 40647 transitions. [2019-11-15 23:15:43,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:15:43,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-11-15 23:15:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:43,944 INFO L225 Difference]: With dead ends: 17247 [2019-11-15 23:15:43,944 INFO L226 Difference]: Without dead ends: 3478 [2019-11-15 23:15:43,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:15:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2019-11-15 23:15:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3476. [2019-11-15 23:15:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-11-15 23:15:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 8216 transitions. [2019-11-15 23:15:43,988 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 8216 transitions. Word has length 103 [2019-11-15 23:15:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:43,989 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 8216 transitions. [2019-11-15 23:15:43,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:15:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 8216 transitions. [2019-11-15 23:15:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:15:43,992 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:43,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:43,993 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash -971943282, now seen corresponding path program 3 times [2019-11-15 23:15:43,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:43,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67439409] [2019-11-15 23:15:43,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:43,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:43,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:15:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:15:44,101 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:15:44,102 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:15:44,287 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:15:44,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:15:44 BasicIcfg [2019-11-15 23:15:44,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:15:44,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:15:44,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:15:44,292 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:15:44,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:08" (3/4) ... [2019-11-15 23:15:44,299 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:15:44,465 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_34ac0fe8-bc0f-44ce-8464-8f4f386d9469/bin/uautomizer/witness.graphml [2019-11-15 23:15:44,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:15:44,468 INFO L168 Benchmark]: Toolchain (without parser) took 98145.78 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 939.3 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:15:44,468 INFO L168 Benchmark]: CDTParser took 0.25 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-15 23:15:44,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -128.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:44,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:44,469 INFO L168 Benchmark]: Boogie Preprocessor took 47.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:15:44,469 INFO L168 Benchmark]: RCFGBuilder took 841.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:44,470 INFO L168 Benchmark]: TraceAbstraction took 96247.39 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-15 23:15:44,470 INFO L168 Benchmark]: Witness Printer took 174.31 ms. Allocated memory is still 6.5 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:44,472 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.25 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 761.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -128.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 841.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96247.39 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 174.31 ms. Allocated memory is still 6.5 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L718] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L719] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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}] [L720] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L721] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L722] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L723] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, 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] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L812] 0 pthread_t t1735; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L813] FCALL, FORK 0 pthread_create(&t1735, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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] [L814] 0 pthread_t t1736; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L815] FCALL, FORK 0 pthread_create(&t1736, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 1 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L775] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L775] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L775] 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) [L776] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L776] 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)) [L777] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L777] 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)) [L778] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L778] 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)) [L779] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L779] 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)) [L780] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L780] 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)) [L781] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L783] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, 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] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=0, y$r_buff0_thd2=1, 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] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L790] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L790] 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) [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L792] 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 [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L794] 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 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L821] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L821] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L821] 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) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L823] 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 [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L825] 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 [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, 280 locations, 3 error locations. Result: UNSAFE, OverallTime: 96.0s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10388 SDtfs, 12275 SDslu, 24323 SDs, 0 SdLazy, 10122 SolverSat, 640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222093occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 207103 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2334 NumberOfCodeBlocks, 2334 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2203 ConstructedInterpolants, 0 QuantifiedInterpolants, 486022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...