./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/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 1ff25ff6f7779916b21d6f014e95708011019eb9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:14:22,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:14:22,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:14:22,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:14:22,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:14:22,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:14:22,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:14:22,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:14:22,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:14:22,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:14:22,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:14:22,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:14:22,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:14:22,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:14:22,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:14:22,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:14:22,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:14:22,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:14:22,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:14:22,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:14:22,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:14:22,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:14:22,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:14:22,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:14:22,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:14:22,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:14:22,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:14:22,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:14:22,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:14:22,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:14:22,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:14:22,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:14:22,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:14:22,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:14:22,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:14:22,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:14:22,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:14:22,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:14:22,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:14:22,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:14:22,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:14:22,479 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:14:22,504 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:14:22,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:14:22,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:14:22,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:14:22,516 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:14:22,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:14:22,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:14:22,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:14:22,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:14:22,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:14:22,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:14:22,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:14:22,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:14:22,519 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:14:22,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:14:22,519 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:14:22,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:14:22,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:14:22,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:14:22,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:14:22,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:14:22,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:14:22,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:14:22,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:14:22,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:14:22,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:14:22,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:14:22,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:14:22,524 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_9913e572-bb58-4ab7-83d3-6bb3280c036b/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 -> 1ff25ff6f7779916b21d6f014e95708011019eb9 [2019-11-15 21:14:22,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:14:22,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:14:22,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:14:22,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:14:22,584 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:14:22,586 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_rmo.oepc.i [2019-11-15 21:14:22,657 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/data/1e543f90d/9485710611c84d3e89f2859022e1ced6/FLAGdeba1ca1e [2019-11-15 21:14:23,188 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:14:23,189 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/sv-benchmarks/c/pthread-wmm/mix022_rmo.oepc.i [2019-11-15 21:14:23,218 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/data/1e543f90d/9485710611c84d3e89f2859022e1ced6/FLAGdeba1ca1e [2019-11-15 21:14:23,467 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/data/1e543f90d/9485710611c84d3e89f2859022e1ced6 [2019-11-15 21:14:23,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:14:23,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:14:23,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:23,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:14:23,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:14:23,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:23" (1/1) ... [2019-11-15 21:14:23,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4720b07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:23, skipping insertion in model container [2019-11-15 21:14:23,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:23" (1/1) ... [2019-11-15 21:14:23,488 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:14:23,543 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:14:24,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:24,055 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:14:24,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:24,205 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:14:24,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24 WrapperNode [2019-11-15 21:14:24,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:24,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:24,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:14:24,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:14:24,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:24,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:14:24,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:14:24,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:14:24,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... [2019-11-15 21:14:24,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:14:24,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:14:24,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:14:24,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:14:24,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/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 21:14:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:14:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:14:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:14:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:14:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:14:24,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:14:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:14:24,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:14:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:14:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:14:24,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:14:24,426 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 21:14:25,310 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:14:25,311 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:14:25,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:25 BoogieIcfgContainer [2019-11-15 21:14:25,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:14:25,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:14:25,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:14:25,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:14:25,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:14:23" (1/3) ... [2019-11-15 21:14:25,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9c1f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:14:25, skipping insertion in model container [2019-11-15 21:14:25,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:24" (2/3) ... [2019-11-15 21:14:25,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9c1f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:14:25, skipping insertion in model container [2019-11-15 21:14:25,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:25" (3/3) ... [2019-11-15 21:14:25,320 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.oepc.i [2019-11-15 21:14:25,357 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,357 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,357 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,357 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,357 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,358 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,358 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,358 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,364 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,365 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,365 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,365 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,365 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,365 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,365 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,365 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,366 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,366 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,366 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,366 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,366 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,367 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,367 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,367 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,367 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,367 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,369 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,369 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,369 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,369 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,369 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,369 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,371 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,371 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,371 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,371 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,371 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,381 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,381 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,381 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,381 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,381 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,382 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,382 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,382 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,382 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,382 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,382 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,383 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,383 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,383 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,383 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,383 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,384 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,384 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,385 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,385 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,385 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,385 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,385 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,386 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,386 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,386 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,386 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,386 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,386 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,387 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,387 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,387 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,387 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,387 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,387 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,388 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,388 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,388 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,388 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,389 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,389 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,389 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,389 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,389 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,389 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,390 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:14:25,406 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:14:25,407 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:14:25,414 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:14:25,428 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:14:25,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:14:25,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:14:25,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:14:25,446 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:14:25,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:14:25,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:14:25,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:14:25,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:14:25,458 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 21:14:28,283 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 21:14:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 21:14:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:14:28,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:28,297 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] [2019-11-15 21:14:28,299 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash -460425359, now seen corresponding path program 1 times [2019-11-15 21:14:28,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:28,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6928409] [2019-11-15 21:14:28,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:28,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:28,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:28,570 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 21:14:28,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6928409] [2019-11-15 21:14:28,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:28,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:28,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967311534] [2019-11-15 21:14:28,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:28,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:28,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:28,594 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 21:14:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:29,674 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 21:14:29,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:29,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 21:14:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:29,963 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 21:14:29,964 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 21:14:29,966 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 21:14:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 21:14:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 21:14:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 21:14:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 21:14:31,657 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 21:14:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:31,662 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 21:14:31,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 21:14:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:14:31,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:31,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:31,680 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash 407606531, now seen corresponding path program 1 times [2019-11-15 21:14:31,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:31,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142718214] [2019-11-15 21:14:31,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:31,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:31,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:31,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142718214] [2019-11-15 21:14:31,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:31,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:14:31,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970165308] [2019-11-15 21:14:31,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:14:31,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:31,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:31,839 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 21:14:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:33,014 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 21:14:33,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:33,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 21:14:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:33,216 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 21:14:33,217 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 21:14:33,218 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 21:14:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 21:14:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 21:14:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 21:14:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 21:14:34,979 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 21:14:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:34,992 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 21:14:34,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:14:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 21:14:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:14:35,002 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:35,002 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] [2019-11-15 21:14:35,003 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:35,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 464590315, now seen corresponding path program 1 times [2019-11-15 21:14:35,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:35,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955361600] [2019-11-15 21:14:35,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:35,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:35,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:35,169 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 21:14:35,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955361600] [2019-11-15 21:14:35,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:35,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:14:35,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589973030] [2019-11-15 21:14:35,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:14:35,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:35,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:35,171 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 21:14:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:35,845 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 21:14:35,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:35,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 21:14:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:36,174 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 21:14:36,174 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 21:14:36,175 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 21:14:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 21:14:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 21:14:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 21:14:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 21:14:37,989 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 21:14:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:37,989 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 21:14:37,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:14:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 21:14:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:14:37,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:37,998 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 21:14:37,999 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:37,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash 765924305, now seen corresponding path program 1 times [2019-11-15 21:14:37,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:37,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898986600] [2019-11-15 21:14:38,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:38,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:38,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:38,047 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 21:14:38,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898986600] [2019-11-15 21:14:38,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:38,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:38,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57815897] [2019-11-15 21:14:38,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:38,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:38,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:38,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:38,049 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 21:14:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:38,370 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 21:14:38,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:38,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 21:14:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:38,564 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 21:14:38,564 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 21:14:38,565 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 21:14:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 21:14:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 21:14:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 21:14:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 21:14:40,511 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 21:14:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:40,511 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 21:14:40,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:14:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 21:14:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:14:40,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:40,530 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:40,531 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1935410276, now seen corresponding path program 1 times [2019-11-15 21:14:40,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:40,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489287123] [2019-11-15 21:14:40,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:40,640 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 21:14:40,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489287123] [2019-11-15 21:14:40,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:40,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:14:40,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891522254] [2019-11-15 21:14:40,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:40,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:40,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:40,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:14:40,642 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 21:14:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:41,575 INFO L93 Difference]: Finished difference Result 61593 states and 219936 transitions. [2019-11-15 21:14:41,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:14:41,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 21:14:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:41,729 INFO L225 Difference]: With dead ends: 61593 [2019-11-15 21:14:41,729 INFO L226 Difference]: Without dead ends: 61025 [2019-11-15 21:14:41,730 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 21:14:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61025 states. [2019-11-15 21:14:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61025 to 47875. [2019-11-15 21:14:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47875 states. [2019-11-15 21:14:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47875 states to 47875 states and 174134 transitions. [2019-11-15 21:14:43,604 INFO L78 Accepts]: Start accepts. Automaton has 47875 states and 174134 transitions. Word has length 52 [2019-11-15 21:14:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:43,604 INFO L462 AbstractCegarLoop]: Abstraction has 47875 states and 174134 transitions. [2019-11-15 21:14:43,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 47875 states and 174134 transitions. [2019-11-15 21:14:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:14:43,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:43,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:43,622 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash 147603122, now seen corresponding path program 1 times [2019-11-15 21:14:43,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:43,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239760547] [2019-11-15 21:14:43,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,751 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 21:14:43,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239760547] [2019-11-15 21:14:43,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:43,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:14:43,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084394062] [2019-11-15 21:14:43,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:43,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:43,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:43,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:14:43,754 INFO L87 Difference]: Start difference. First operand 47875 states and 174134 transitions. Second operand 6 states. [2019-11-15 21:14:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:44,831 INFO L93 Difference]: Finished difference Result 64221 states and 231062 transitions. [2019-11-15 21:14:44,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:44,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 21:14:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:44,985 INFO L225 Difference]: With dead ends: 64221 [2019-11-15 21:14:44,986 INFO L226 Difference]: Without dead ends: 64221 [2019-11-15 21:14:44,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:14:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64221 states. [2019-11-15 21:14:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64221 to 60245. [2019-11-15 21:14:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60245 states. [2019-11-15 21:14:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60245 states to 60245 states and 216821 transitions. [2019-11-15 21:14:49,261 INFO L78 Accepts]: Start accepts. Automaton has 60245 states and 216821 transitions. Word has length 52 [2019-11-15 21:14:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:49,262 INFO L462 AbstractCegarLoop]: Abstraction has 60245 states and 216821 transitions. [2019-11-15 21:14:49,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 60245 states and 216821 transitions. [2019-11-15 21:14:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:14:49,281 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:49,281 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:49,281 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1649348237, now seen corresponding path program 1 times [2019-11-15 21:14:49,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:49,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038316634] [2019-11-15 21:14:49,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:49,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:49,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:49,392 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 21:14:49,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038316634] [2019-11-15 21:14:49,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:49,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:14:49,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872008868] [2019-11-15 21:14:49,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:14:49,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:49,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:49,394 INFO L87 Difference]: Start difference. First operand 60245 states and 216821 transitions. Second operand 5 states. [2019-11-15 21:14:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:49,491 INFO L93 Difference]: Finished difference Result 12808 states and 39725 transitions. [2019-11-15 21:14:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:14:49,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-15 21:14:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:49,511 INFO L225 Difference]: With dead ends: 12808 [2019-11-15 21:14:49,512 INFO L226 Difference]: Without dead ends: 11096 [2019-11-15 21:14:49,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 21:14:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11096 states. [2019-11-15 21:14:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11096 to 11047. [2019-11-15 21:14:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-11-15 21:14:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 33784 transitions. [2019-11-15 21:14:49,714 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 33784 transitions. Word has length 52 [2019-11-15 21:14:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:49,715 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 33784 transitions. [2019-11-15 21:14:49,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:14:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 33784 transitions. [2019-11-15 21:14:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:14:49,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:49,720 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] [2019-11-15 21:14:49,720 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1079306888, now seen corresponding path program 1 times [2019-11-15 21:14:49,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:49,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019975549] [2019-11-15 21:14:49,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:49,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:49,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:49,785 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 21:14:49,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019975549] [2019-11-15 21:14:49,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:49,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:49,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701267772] [2019-11-15 21:14:49,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:49,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:49,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:49,787 INFO L87 Difference]: Start difference. First operand 11047 states and 33784 transitions. Second operand 4 states. [2019-11-15 21:14:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:49,936 INFO L93 Difference]: Finished difference Result 12861 states and 39390 transitions. [2019-11-15 21:14:49,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:14:49,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 21:14:49,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:49,957 INFO L225 Difference]: With dead ends: 12861 [2019-11-15 21:14:49,957 INFO L226 Difference]: Without dead ends: 12861 [2019-11-15 21:14:49,957 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 21:14:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-11-15 21:14:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 11692. [2019-11-15 21:14:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2019-11-15 21:14:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 35761 transitions. [2019-11-15 21:14:50,147 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 35761 transitions. Word has length 60 [2019-11-15 21:14:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:50,147 INFO L462 AbstractCegarLoop]: Abstraction has 11692 states and 35761 transitions. [2019-11-15 21:14:50,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 35761 transitions. [2019-11-15 21:14:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:14:50,151 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:50,151 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] [2019-11-15 21:14:50,151 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:50,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:50,151 INFO L82 PathProgramCache]: Analyzing trace with hash 663503447, now seen corresponding path program 1 times [2019-11-15 21:14:50,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:50,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967088095] [2019-11-15 21:14:50,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:50,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:50,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:50,230 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 21:14:50,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967088095] [2019-11-15 21:14:50,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:50,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:14:50,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343670133] [2019-11-15 21:14:50,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:50,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:50,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:14:50,231 INFO L87 Difference]: Start difference. First operand 11692 states and 35761 transitions. Second operand 6 states. [2019-11-15 21:14:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:50,713 INFO L93 Difference]: Finished difference Result 14218 states and 42859 transitions. [2019-11-15 21:14:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:14:50,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 21:14:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:50,740 INFO L225 Difference]: With dead ends: 14218 [2019-11-15 21:14:50,740 INFO L226 Difference]: Without dead ends: 14157 [2019-11-15 21:14:50,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:14:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-11-15 21:14:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13460. [2019-11-15 21:14:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13460 states. [2019-11-15 21:14:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 40778 transitions. [2019-11-15 21:14:50,930 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 40778 transitions. Word has length 60 [2019-11-15 21:14:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:50,930 INFO L462 AbstractCegarLoop]: Abstraction has 13460 states and 40778 transitions. [2019-11-15 21:14:50,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 40778 transitions. [2019-11-15 21:14:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:14:50,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:50,937 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 21:14:50,937 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:50,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2104141598, now seen corresponding path program 1 times [2019-11-15 21:14:50,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:50,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3847050] [2019-11-15 21:14:50,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:50,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:50,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:51,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 21:14:51,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3847050] [2019-11-15 21:14:51,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:51,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:51,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155510369] [2019-11-15 21:14:51,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:51,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:51,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:51,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:51,005 INFO L87 Difference]: Start difference. First operand 13460 states and 40778 transitions. Second operand 4 states. [2019-11-15 21:14:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:51,308 INFO L93 Difference]: Finished difference Result 16502 states and 49370 transitions. [2019-11-15 21:14:51,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:51,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 21:14:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:51,333 INFO L225 Difference]: With dead ends: 16502 [2019-11-15 21:14:51,334 INFO L226 Difference]: Without dead ends: 16502 [2019-11-15 21:14:51,334 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 21:14:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16502 states. [2019-11-15 21:14:51,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16502 to 14981. [2019-11-15 21:14:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-11-15 21:14:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 44959 transitions. [2019-11-15 21:14:51,547 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 44959 transitions. Word has length 64 [2019-11-15 21:14:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:51,547 INFO L462 AbstractCegarLoop]: Abstraction has 14981 states and 44959 transitions. [2019-11-15 21:14:51,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 44959 transitions. [2019-11-15 21:14:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:14:51,555 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:51,555 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 21:14:51,555 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash 113616355, now seen corresponding path program 1 times [2019-11-15 21:14:51,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:51,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684787309] [2019-11-15 21:14:51,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:51,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:51,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:51,603 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 21:14:51,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684787309] [2019-11-15 21:14:51,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:51,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:51,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850103063] [2019-11-15 21:14:51,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:51,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:51,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:51,605 INFO L87 Difference]: Start difference. First operand 14981 states and 44959 transitions. Second operand 3 states. [2019-11-15 21:14:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:51,917 INFO L93 Difference]: Finished difference Result 15529 states and 46402 transitions. [2019-11-15 21:14:51,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:51,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 21:14:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:52,429 INFO L225 Difference]: With dead ends: 15529 [2019-11-15 21:14:52,429 INFO L226 Difference]: Without dead ends: 15529 [2019-11-15 21:14:52,429 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 21:14:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-11-15 21:14:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 15275. [2019-11-15 21:14:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-11-15 21:14:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45727 transitions. [2019-11-15 21:14:52,695 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45727 transitions. Word has length 64 [2019-11-15 21:14:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:52,696 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45727 transitions. [2019-11-15 21:14:52,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:14:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45727 transitions. [2019-11-15 21:14:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:14:52,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:52,705 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] [2019-11-15 21:14:52,705 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1874779720, now seen corresponding path program 1 times [2019-11-15 21:14:52,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:52,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992372870] [2019-11-15 21:14:52,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:52,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:52,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:52,736 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 21:14:52,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992372870] [2019-11-15 21:14:52,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:52,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:52,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239809469] [2019-11-15 21:14:52,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:52,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:52,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:52,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:52,738 INFO L87 Difference]: Start difference. First operand 15275 states and 45727 transitions. Second operand 3 states. [2019-11-15 21:14:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:52,829 INFO L93 Difference]: Finished difference Result 19973 states and 59414 transitions. [2019-11-15 21:14:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:52,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 21:14:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:52,868 INFO L225 Difference]: With dead ends: 19973 [2019-11-15 21:14:52,868 INFO L226 Difference]: Without dead ends: 19973 [2019-11-15 21:14:52,869 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 21:14:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19973 states. [2019-11-15 21:14:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19973 to 15169. [2019-11-15 21:14:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15169 states. [2019-11-15 21:14:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15169 states to 15169 states and 44681 transitions. [2019-11-15 21:14:53,189 INFO L78 Accepts]: Start accepts. Automaton has 15169 states and 44681 transitions. Word has length 66 [2019-11-15 21:14:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:53,189 INFO L462 AbstractCegarLoop]: Abstraction has 15169 states and 44681 transitions. [2019-11-15 21:14:53,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:14:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15169 states and 44681 transitions. [2019-11-15 21:14:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:14:53,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:53,201 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] [2019-11-15 21:14:53,201 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:53,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1174363048, now seen corresponding path program 1 times [2019-11-15 21:14:53,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:53,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682768019] [2019-11-15 21:14:53,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:53,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:53,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:53,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682768019] [2019-11-15 21:14:53,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:53,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:14:53,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681068405] [2019-11-15 21:14:53,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:53,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:53,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:53,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:14:53,355 INFO L87 Difference]: Start difference. First operand 15169 states and 44681 transitions. Second operand 6 states. [2019-11-15 21:14:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:54,045 INFO L93 Difference]: Finished difference Result 16152 states and 46959 transitions. [2019-11-15 21:14:54,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:54,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 21:14:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:54,069 INFO L225 Difference]: With dead ends: 16152 [2019-11-15 21:14:54,069 INFO L226 Difference]: Without dead ends: 16152 [2019-11-15 21:14:54,069 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 21:14:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16152 states. [2019-11-15 21:14:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16152 to 15734. [2019-11-15 21:14:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15734 states. [2019-11-15 21:14:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15734 states to 15734 states and 45914 transitions. [2019-11-15 21:14:54,277 INFO L78 Accepts]: Start accepts. Automaton has 15734 states and 45914 transitions. Word has length 66 [2019-11-15 21:14:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:54,278 INFO L462 AbstractCegarLoop]: Abstraction has 15734 states and 45914 transitions. [2019-11-15 21:14:54,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 15734 states and 45914 transitions. [2019-11-15 21:14:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:14:54,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:54,289 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] [2019-11-15 21:14:54,289 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:54,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -902846295, now seen corresponding path program 1 times [2019-11-15 21:14:54,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:54,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591475636] [2019-11-15 21:14:54,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:54,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:54,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:54,390 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 21:14:54,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591475636] [2019-11-15 21:14:54,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:54,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:14:54,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819548352] [2019-11-15 21:14:54,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:54,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:14:54,392 INFO L87 Difference]: Start difference. First operand 15734 states and 45914 transitions. Second operand 6 states. [2019-11-15 21:14:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:54,879 INFO L93 Difference]: Finished difference Result 18009 states and 51105 transitions. [2019-11-15 21:14:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:14:54,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 21:14:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:54,909 INFO L225 Difference]: With dead ends: 18009 [2019-11-15 21:14:54,909 INFO L226 Difference]: Without dead ends: 18009 [2019-11-15 21:14:54,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:14:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18009 states. [2019-11-15 21:14:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18009 to 16463. [2019-11-15 21:14:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16463 states. [2019-11-15 21:14:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16463 states to 16463 states and 47196 transitions. [2019-11-15 21:14:55,216 INFO L78 Accepts]: Start accepts. Automaton has 16463 states and 47196 transitions. Word has length 66 [2019-11-15 21:14:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:55,217 INFO L462 AbstractCegarLoop]: Abstraction has 16463 states and 47196 transitions. [2019-11-15 21:14:55,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 16463 states and 47196 transitions. [2019-11-15 21:14:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:14:55,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:55,230 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] [2019-11-15 21:14:55,230 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:55,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -691495382, now seen corresponding path program 1 times [2019-11-15 21:14:55,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:55,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313809138] [2019-11-15 21:14:55,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:55,318 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 21:14:55,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313809138] [2019-11-15 21:14:55,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:55,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:14:55,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949338949] [2019-11-15 21:14:55,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:14:55,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:55,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:55,319 INFO L87 Difference]: Start difference. First operand 16463 states and 47196 transitions. Second operand 5 states. [2019-11-15 21:14:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:55,788 INFO L93 Difference]: Finished difference Result 21377 states and 61186 transitions. [2019-11-15 21:14:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:14:55,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 21:14:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:55,817 INFO L225 Difference]: With dead ends: 21377 [2019-11-15 21:14:55,817 INFO L226 Difference]: Without dead ends: 21377 [2019-11-15 21:14:55,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:14:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21377 states. [2019-11-15 21:14:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21377 to 19442. [2019-11-15 21:14:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19442 states. [2019-11-15 21:14:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19442 states to 19442 states and 55401 transitions. [2019-11-15 21:14:56,081 INFO L78 Accepts]: Start accepts. Automaton has 19442 states and 55401 transitions. Word has length 66 [2019-11-15 21:14:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:56,081 INFO L462 AbstractCegarLoop]: Abstraction has 19442 states and 55401 transitions. [2019-11-15 21:14:56,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:14:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 19442 states and 55401 transitions. [2019-11-15 21:14:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:14:56,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:56,094 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] [2019-11-15 21:14:56,094 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1202029559, now seen corresponding path program 1 times [2019-11-15 21:14:56,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:56,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319754012] [2019-11-15 21:14:56,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:56,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:56,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:56,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319754012] [2019-11-15 21:14:56,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:56,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:14:56,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754055319] [2019-11-15 21:14:56,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:14:56,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:56,172 INFO L87 Difference]: Start difference. First operand 19442 states and 55401 transitions. Second operand 5 states. [2019-11-15 21:14:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:56,860 INFO L93 Difference]: Finished difference Result 25955 states and 73603 transitions. [2019-11-15 21:14:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:56,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 21:14:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:56,916 INFO L225 Difference]: With dead ends: 25955 [2019-11-15 21:14:56,916 INFO L226 Difference]: Without dead ends: 25955 [2019-11-15 21:14:56,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:14:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25955 states. [2019-11-15 21:14:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25955 to 21135. [2019-11-15 21:14:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21135 states. [2019-11-15 21:14:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21135 states to 21135 states and 60029 transitions. [2019-11-15 21:14:57,237 INFO L78 Accepts]: Start accepts. Automaton has 21135 states and 60029 transitions. Word has length 66 [2019-11-15 21:14:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:57,237 INFO L462 AbstractCegarLoop]: Abstraction has 21135 states and 60029 transitions. [2019-11-15 21:14:57,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:14:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 21135 states and 60029 transitions. [2019-11-15 21:14:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:14:57,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:57,247 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:57,247 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:57,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1285483274, now seen corresponding path program 1 times [2019-11-15 21:14:57,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:57,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091033703] [2019-11-15 21:14:57,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:57,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:57,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:57,321 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 21:14:57,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091033703] [2019-11-15 21:14:57,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:57,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:57,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090826747] [2019-11-15 21:14:57,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:57,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:57,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:57,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:57,323 INFO L87 Difference]: Start difference. First operand 21135 states and 60029 transitions. Second operand 4 states. [2019-11-15 21:14:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:57,942 INFO L93 Difference]: Finished difference Result 27651 states and 79004 transitions. [2019-11-15 21:14:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:14:57,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 21:14:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:57,985 INFO L225 Difference]: With dead ends: 27651 [2019-11-15 21:14:57,985 INFO L226 Difference]: Without dead ends: 27516 [2019-11-15 21:14:57,985 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 21:14:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27516 states. [2019-11-15 21:14:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27516 to 25527. [2019-11-15 21:14:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25527 states. [2019-11-15 21:14:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25527 states to 25527 states and 72941 transitions. [2019-11-15 21:14:58,671 INFO L78 Accepts]: Start accepts. Automaton has 25527 states and 72941 transitions. Word has length 66 [2019-11-15 21:14:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:58,672 INFO L462 AbstractCegarLoop]: Abstraction has 25527 states and 72941 transitions. [2019-11-15 21:14:58,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 25527 states and 72941 transitions. [2019-11-15 21:14:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:14:58,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:58,680 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] [2019-11-15 21:14:58,680 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:58,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -511468085, now seen corresponding path program 1 times [2019-11-15 21:14:58,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:58,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397618745] [2019-11-15 21:14:58,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:58,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:58,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:58,753 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 21:14:58,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397618745] [2019-11-15 21:14:58,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:58,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:14:58,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89348703] [2019-11-15 21:14:58,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:14:58,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:58,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:58,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:58,754 INFO L87 Difference]: Start difference. First operand 25527 states and 72941 transitions. Second operand 5 states. [2019-11-15 21:14:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:58,812 INFO L93 Difference]: Finished difference Result 7275 states and 16793 transitions. [2019-11-15 21:14:58,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:14:58,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 21:14:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:58,819 INFO L225 Difference]: With dead ends: 7275 [2019-11-15 21:14:58,819 INFO L226 Difference]: Without dead ends: 6105 [2019-11-15 21:14:58,819 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 21:14:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2019-11-15 21:14:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5195. [2019-11-15 21:14:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5195 states. [2019-11-15 21:14:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 11682 transitions. [2019-11-15 21:14:58,893 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 11682 transitions. Word has length 66 [2019-11-15 21:14:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:58,894 INFO L462 AbstractCegarLoop]: Abstraction has 5195 states and 11682 transitions. [2019-11-15 21:14:58,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:14:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 11682 transitions. [2019-11-15 21:14:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:14:58,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:58,900 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] [2019-11-15 21:14:58,900 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash -418310117, now seen corresponding path program 1 times [2019-11-15 21:14:58,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:58,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790666849] [2019-11-15 21:14:58,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:58,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:58,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:58,972 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 21:14:58,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790666849] [2019-11-15 21:14:58,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:58,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:14:58,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541698880] [2019-11-15 21:14:58,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:14:58,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:58,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:58,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:58,975 INFO L87 Difference]: Start difference. First operand 5195 states and 11682 transitions. Second operand 5 states. [2019-11-15 21:14:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:59,142 INFO L93 Difference]: Finished difference Result 6272 states and 14147 transitions. [2019-11-15 21:14:59,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:14:59,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 21:14:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:59,149 INFO L225 Difference]: With dead ends: 6272 [2019-11-15 21:14:59,149 INFO L226 Difference]: Without dead ends: 6272 [2019-11-15 21:14:59,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:14:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2019-11-15 21:14:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 5615. [2019-11-15 21:14:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5615 states. [2019-11-15 21:14:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 12640 transitions. [2019-11-15 21:14:59,208 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 12640 transitions. Word has length 72 [2019-11-15 21:14:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:59,209 INFO L462 AbstractCegarLoop]: Abstraction has 5615 states and 12640 transitions. [2019-11-15 21:14:59,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:14:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 12640 transitions. [2019-11-15 21:14:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:14:59,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:59,213 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] [2019-11-15 21:14:59,213 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1324500218, now seen corresponding path program 1 times [2019-11-15 21:14:59,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:59,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245400759] [2019-11-15 21:14:59,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:59,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:59,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:59,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245400759] [2019-11-15 21:14:59,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:59,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:14:59,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619604815] [2019-11-15 21:14:59,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:14:59,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:14:59,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:14:59,288 INFO L87 Difference]: Start difference. First operand 5615 states and 12640 transitions. Second operand 7 states. [2019-11-15 21:14:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:59,693 INFO L93 Difference]: Finished difference Result 6482 states and 14450 transitions. [2019-11-15 21:14:59,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:14:59,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 21:14:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:59,698 INFO L225 Difference]: With dead ends: 6482 [2019-11-15 21:14:59,699 INFO L226 Difference]: Without dead ends: 6429 [2019-11-15 21:14:59,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:14:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2019-11-15 21:14:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 5702. [2019-11-15 21:14:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5702 states. [2019-11-15 21:14:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 12729 transitions. [2019-11-15 21:14:59,751 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 12729 transitions. Word has length 72 [2019-11-15 21:14:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:59,751 INFO L462 AbstractCegarLoop]: Abstraction has 5702 states and 12729 transitions. [2019-11-15 21:14:59,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:14:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 12729 transitions. [2019-11-15 21:14:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 21:14:59,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:59,757 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] [2019-11-15 21:14:59,758 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:59,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2045827091, now seen corresponding path program 1 times [2019-11-15 21:14:59,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:59,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843075513] [2019-11-15 21:14:59,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:59,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:59,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:59,804 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 21:14:59,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843075513] [2019-11-15 21:14:59,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:59,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:59,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050745335] [2019-11-15 21:14:59,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:59,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:59,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:59,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:59,807 INFO L87 Difference]: Start difference. First operand 5702 states and 12729 transitions. Second operand 3 states. [2019-11-15 21:15:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:00,054 INFO L93 Difference]: Finished difference Result 7168 states and 15786 transitions. [2019-11-15 21:15:00,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:15:00,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-15 21:15:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:00,063 INFO L225 Difference]: With dead ends: 7168 [2019-11-15 21:15:00,064 INFO L226 Difference]: Without dead ends: 7168 [2019-11-15 21:15:00,067 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 21:15:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2019-11-15 21:15:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 6671. [2019-11-15 21:15:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2019-11-15 21:15:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 14733 transitions. [2019-11-15 21:15:00,167 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 14733 transitions. Word has length 91 [2019-11-15 21:15:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:00,168 INFO L462 AbstractCegarLoop]: Abstraction has 6671 states and 14733 transitions. [2019-11-15 21:15:00,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:15:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 14733 transitions. [2019-11-15 21:15:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 21:15:00,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:00,177 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] [2019-11-15 21:15:00,177 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash -537033389, now seen corresponding path program 2 times [2019-11-15 21:15:00,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:00,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039020351] [2019-11-15 21:15:00,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:00,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:00,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:00,252 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 21:15:00,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039020351] [2019-11-15 21:15:00,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:00,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:15:00,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621202307] [2019-11-15 21:15:00,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:15:00,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:00,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:15:00,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:15:00,254 INFO L87 Difference]: Start difference. First operand 6671 states and 14733 transitions. Second operand 4 states. [2019-11-15 21:15:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:00,401 INFO L93 Difference]: Finished difference Result 7148 states and 15815 transitions. [2019-11-15 21:15:00,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:15:00,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 21:15:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:00,411 INFO L225 Difference]: With dead ends: 7148 [2019-11-15 21:15:00,411 INFO L226 Difference]: Without dead ends: 7148 [2019-11-15 21:15:00,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7148 states. [2019-11-15 21:15:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7148 to 6569. [2019-11-15 21:15:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6569 states. [2019-11-15 21:15:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 14589 transitions. [2019-11-15 21:15:00,495 INFO L78 Accepts]: Start accepts. Automaton has 6569 states and 14589 transitions. Word has length 91 [2019-11-15 21:15:00,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:00,495 INFO L462 AbstractCegarLoop]: Abstraction has 6569 states and 14589 transitions. [2019-11-15 21:15:00,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:15:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6569 states and 14589 transitions. [2019-11-15 21:15:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:00,503 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:00,503 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] [2019-11-15 21:15:00,504 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash 514072041, now seen corresponding path program 1 times [2019-11-15 21:15:00,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:00,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624314767] [2019-11-15 21:15:00,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:00,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:00,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:00,565 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 21:15:00,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624314767] [2019-11-15 21:15:00,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:00,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:15:00,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045612776] [2019-11-15 21:15:00,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:15:00,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:00,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:15:00,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:00,567 INFO L87 Difference]: Start difference. First operand 6569 states and 14589 transitions. Second operand 5 states. [2019-11-15 21:15:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:00,813 INFO L93 Difference]: Finished difference Result 7502 states and 16583 transitions. [2019-11-15 21:15:00,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:15:00,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 21:15:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:00,820 INFO L225 Difference]: With dead ends: 7502 [2019-11-15 21:15:00,820 INFO L226 Difference]: Without dead ends: 7502 [2019-11-15 21:15:00,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:15:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-11-15 21:15:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 6609. [2019-11-15 21:15:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6609 states. [2019-11-15 21:15:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 14672 transitions. [2019-11-15 21:15:00,903 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 14672 transitions. Word has length 93 [2019-11-15 21:15:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:00,903 INFO L462 AbstractCegarLoop]: Abstraction has 6609 states and 14672 transitions. [2019-11-15 21:15:00,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:15:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 14672 transitions. [2019-11-15 21:15:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:00,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:00,913 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:00,913 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1557973675, now seen corresponding path program 1 times [2019-11-15 21:15:00,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:00,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930500134] [2019-11-15 21:15:00,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:00,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:00,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:01,065 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 21:15:01,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930500134] [2019-11-15 21:15:01,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:01,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:15:01,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180662429] [2019-11-15 21:15:01,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:15:01,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:01,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:15:01,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:15:01,068 INFO L87 Difference]: Start difference. First operand 6609 states and 14672 transitions. Second operand 9 states. [2019-11-15 21:15:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:02,659 INFO L93 Difference]: Finished difference Result 13060 states and 28465 transitions. [2019-11-15 21:15:02,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 21:15:02,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-11-15 21:15:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:02,672 INFO L225 Difference]: With dead ends: 13060 [2019-11-15 21:15:02,672 INFO L226 Difference]: Without dead ends: 13060 [2019-11-15 21:15:02,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-11-15 21:15:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13060 states. [2019-11-15 21:15:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13060 to 8461. [2019-11-15 21:15:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-15 21:15:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 18673 transitions. [2019-11-15 21:15:02,793 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 18673 transitions. Word has length 93 [2019-11-15 21:15:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:02,793 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 18673 transitions. [2019-11-15 21:15:02,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:15:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 18673 transitions. [2019-11-15 21:15:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:02,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:02,800 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] [2019-11-15 21:15:02,800 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1550214316, now seen corresponding path program 1 times [2019-11-15 21:15:02,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:02,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686513391] [2019-11-15 21:15:02,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:02,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:02,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:02,873 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 21:15:02,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686513391] [2019-11-15 21:15:02,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:02,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:15:02,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855748707] [2019-11-15 21:15:02,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:15:02,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:15:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:02,876 INFO L87 Difference]: Start difference. First operand 8461 states and 18673 transitions. Second operand 5 states. [2019-11-15 21:15:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:02,971 INFO L93 Difference]: Finished difference Result 8585 states and 19120 transitions. [2019-11-15 21:15:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:15:02,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 21:15:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:02,979 INFO L225 Difference]: With dead ends: 8585 [2019-11-15 21:15:02,979 INFO L226 Difference]: Without dead ends: 8585 [2019-11-15 21:15:02,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:15:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8585 states. [2019-11-15 21:15:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8585 to 6542. [2019-11-15 21:15:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-11-15 21:15:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 14641 transitions. [2019-11-15 21:15:03,059 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 14641 transitions. Word has length 93 [2019-11-15 21:15:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:03,060 INFO L462 AbstractCegarLoop]: Abstraction has 6542 states and 14641 transitions. [2019-11-15 21:15:03,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:15:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 14641 transitions. [2019-11-15 21:15:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:03,066 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:03,066 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] [2019-11-15 21:15:03,066 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:03,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:03,066 INFO L82 PathProgramCache]: Analyzing trace with hash -633462611, now seen corresponding path program 1 times [2019-11-15 21:15:03,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:03,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270198155] [2019-11-15 21:15:03,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:03,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:03,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:03,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 21:15:03,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270198155] [2019-11-15 21:15:03,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:03,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:15:03,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843170078] [2019-11-15 21:15:03,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:15:03,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:15:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:15:03,236 INFO L87 Difference]: Start difference. First operand 6542 states and 14641 transitions. Second operand 8 states. [2019-11-15 21:15:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:03,590 INFO L93 Difference]: Finished difference Result 10035 states and 22193 transitions. [2019-11-15 21:15:03,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:15:03,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-11-15 21:15:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:03,600 INFO L225 Difference]: With dead ends: 10035 [2019-11-15 21:15:03,600 INFO L226 Difference]: Without dead ends: 10023 [2019-11-15 21:15:03,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:15:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10023 states. [2019-11-15 21:15:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10023 to 7459. [2019-11-15 21:15:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7459 states. [2019-11-15 21:15:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7459 states to 7459 states and 16697 transitions. [2019-11-15 21:15:03,694 INFO L78 Accepts]: Start accepts. Automaton has 7459 states and 16697 transitions. Word has length 93 [2019-11-15 21:15:03,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:03,694 INFO L462 AbstractCegarLoop]: Abstraction has 7459 states and 16697 transitions. [2019-11-15 21:15:03,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:15:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 7459 states and 16697 transitions. [2019-11-15 21:15:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:03,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:03,700 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:15:03,701 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash 611301870, now seen corresponding path program 1 times [2019-11-15 21:15:03,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:03,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081768094] [2019-11-15 21:15:03,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:03,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:03,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:03,769 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 21:15:03,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081768094] [2019-11-15 21:15:03,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:03,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:15:03,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524199838] [2019-11-15 21:15:03,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:15:03,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:03,771 INFO L87 Difference]: Start difference. First operand 7459 states and 16697 transitions. Second operand 6 states. [2019-11-15 21:15:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:04,234 INFO L93 Difference]: Finished difference Result 9307 states and 20721 transitions. [2019-11-15 21:15:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:15:04,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 21:15:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:04,245 INFO L225 Difference]: With dead ends: 9307 [2019-11-15 21:15:04,245 INFO L226 Difference]: Without dead ends: 9307 [2019-11-15 21:15:04,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:15:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9307 states. [2019-11-15 21:15:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9307 to 7248. [2019-11-15 21:15:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7248 states. [2019-11-15 21:15:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 16275 transitions. [2019-11-15 21:15:04,360 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 16275 transitions. Word has length 93 [2019-11-15 21:15:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:04,360 INFO L462 AbstractCegarLoop]: Abstraction has 7248 states and 16275 transitions. [2019-11-15 21:15:04,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:15:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 16275 transitions. [2019-11-15 21:15:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:04,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:04,370 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] [2019-11-15 21:15:04,370 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:04,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1247947235, now seen corresponding path program 1 times [2019-11-15 21:15:04,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:04,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444940195] [2019-11-15 21:15:04,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:04,484 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 21:15:04,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444940195] [2019-11-15 21:15:04,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:04,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:15:04,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396730296] [2019-11-15 21:15:04,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:15:04,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:04,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:04,487 INFO L87 Difference]: Start difference. First operand 7248 states and 16275 transitions. Second operand 6 states. [2019-11-15 21:15:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:04,902 INFO L93 Difference]: Finished difference Result 9153 states and 20401 transitions. [2019-11-15 21:15:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:15:04,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 21:15:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:04,915 INFO L225 Difference]: With dead ends: 9153 [2019-11-15 21:15:04,915 INFO L226 Difference]: Without dead ends: 9135 [2019-11-15 21:15:04,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:15:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9135 states. [2019-11-15 21:15:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9135 to 7422. [2019-11-15 21:15:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7422 states. [2019-11-15 21:15:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7422 states to 7422 states and 16683 transitions. [2019-11-15 21:15:05,027 INFO L78 Accepts]: Start accepts. Automaton has 7422 states and 16683 transitions. Word has length 93 [2019-11-15 21:15:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:05,028 INFO L462 AbstractCegarLoop]: Abstraction has 7422 states and 16683 transitions. [2019-11-15 21:15:05,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:15:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 7422 states and 16683 transitions. [2019-11-15 21:15:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:05,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:05,036 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] [2019-11-15 21:15:05,036 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1250068702, now seen corresponding path program 1 times [2019-11-15 21:15:05,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:05,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893069793] [2019-11-15 21:15:05,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:05,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:05,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:05,157 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 21:15:05,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893069793] [2019-11-15 21:15:05,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:05,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:15:05,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328748307] [2019-11-15 21:15:05,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:15:05,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:15:05,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:15:05,159 INFO L87 Difference]: Start difference. First operand 7422 states and 16683 transitions. Second operand 7 states. [2019-11-15 21:15:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:05,410 INFO L93 Difference]: Finished difference Result 9441 states and 21188 transitions. [2019-11-15 21:15:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:15:05,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 21:15:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:05,423 INFO L225 Difference]: With dead ends: 9441 [2019-11-15 21:15:05,423 INFO L226 Difference]: Without dead ends: 9441 [2019-11-15 21:15:05,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:15:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9441 states. [2019-11-15 21:15:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9441 to 6959. [2019-11-15 21:15:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6959 states. [2019-11-15 21:15:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 15528 transitions. [2019-11-15 21:15:05,603 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 15528 transitions. Word has length 93 [2019-11-15 21:15:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:05,603 INFO L462 AbstractCegarLoop]: Abstraction has 6959 states and 15528 transitions. [2019-11-15 21:15:05,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:15:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 15528 transitions. [2019-11-15 21:15:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:05,612 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:05,612 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] [2019-11-15 21:15:05,612 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:05,613 INFO L82 PathProgramCache]: Analyzing trace with hash -827140641, now seen corresponding path program 1 times [2019-11-15 21:15:05,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:05,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075483864] [2019-11-15 21:15:05,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:05,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:05,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:05,684 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 21:15:05,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075483864] [2019-11-15 21:15:05,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:05,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:15:05,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237988245] [2019-11-15 21:15:05,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:15:05,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:05,687 INFO L87 Difference]: Start difference. First operand 6959 states and 15528 transitions. Second operand 6 states. [2019-11-15 21:15:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:06,029 INFO L93 Difference]: Finished difference Result 9166 states and 20073 transitions. [2019-11-15 21:15:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:15:06,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 21:15:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:06,039 INFO L225 Difference]: With dead ends: 9166 [2019-11-15 21:15:06,039 INFO L226 Difference]: Without dead ends: 9166 [2019-11-15 21:15:06,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9166 states. [2019-11-15 21:15:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9166 to 7184. [2019-11-15 21:15:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7184 states. [2019-11-15 21:15:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7184 states to 7184 states and 15996 transitions. [2019-11-15 21:15:06,145 INFO L78 Accepts]: Start accepts. Automaton has 7184 states and 15996 transitions. Word has length 93 [2019-11-15 21:15:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:06,145 INFO L462 AbstractCegarLoop]: Abstraction has 7184 states and 15996 transitions. [2019-11-15 21:15:06,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:15:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7184 states and 15996 transitions. [2019-11-15 21:15:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:15:06,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:15:06,154 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1671612512, now seen corresponding path program 1 times [2019-11-15 21:15:06,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:06,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802031216] [2019-11-15 21:15:06,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:06,227 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 21:15:06,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802031216] [2019-11-15 21:15:06,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:06,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:15:06,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950869300] [2019-11-15 21:15:06,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:15:06,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:15:06,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:15:06,229 INFO L87 Difference]: Start difference. First operand 7184 states and 15996 transitions. Second operand 3 states. [2019-11-15 21:15:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:06,262 INFO L93 Difference]: Finished difference Result 7148 states and 15849 transitions. [2019-11-15 21:15:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:15:06,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-15 21:15:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:06,272 INFO L225 Difference]: With dead ends: 7148 [2019-11-15 21:15:06,272 INFO L226 Difference]: Without dead ends: 7130 [2019-11-15 21:15:06,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 21:15:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2019-11-15 21:15:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 6128. [2019-11-15 21:15:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6128 states. [2019-11-15 21:15:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6128 states to 6128 states and 13628 transitions. [2019-11-15 21:15:06,372 INFO L78 Accepts]: Start accepts. Automaton has 6128 states and 13628 transitions. Word has length 93 [2019-11-15 21:15:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:06,372 INFO L462 AbstractCegarLoop]: Abstraction has 6128 states and 13628 transitions. [2019-11-15 21:15:06,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:15:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6128 states and 13628 transitions. [2019-11-15 21:15:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:15:06,380 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:06,380 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] [2019-11-15 21:15:06,381 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash 829519093, now seen corresponding path program 1 times [2019-11-15 21:15:06,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:06,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598894534] [2019-11-15 21:15:06,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:06,458 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 21:15:06,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598894534] [2019-11-15 21:15:06,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:06,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:15:06,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736993877] [2019-11-15 21:15:06,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:15:06,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:06,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:15:06,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:15:06,463 INFO L87 Difference]: Start difference. First operand 6128 states and 13628 transitions. Second operand 4 states. [2019-11-15 21:15:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:06,501 INFO L93 Difference]: Finished difference Result 6083 states and 13505 transitions. [2019-11-15 21:15:06,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:15:06,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:15:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:06,509 INFO L225 Difference]: With dead ends: 6083 [2019-11-15 21:15:06,509 INFO L226 Difference]: Without dead ends: 6083 [2019-11-15 21:15:06,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6083 states. [2019-11-15 21:15:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6083 to 5627. [2019-11-15 21:15:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2019-11-15 21:15:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 12462 transitions. [2019-11-15 21:15:06,598 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 12462 transitions. Word has length 95 [2019-11-15 21:15:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:06,598 INFO L462 AbstractCegarLoop]: Abstraction has 5627 states and 12462 transitions. [2019-11-15 21:15:06,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:15:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 12462 transitions. [2019-11-15 21:15:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:15:06,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:06,605 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] [2019-11-15 21:15:06,606 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1477966443, now seen corresponding path program 1 times [2019-11-15 21:15:06,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:06,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265041469] [2019-11-15 21:15:06,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:06,810 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 21:15:06,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265041469] [2019-11-15 21:15:06,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:06,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:15:06,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521366711] [2019-11-15 21:15:06,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:15:06,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:15:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:15:06,812 INFO L87 Difference]: Start difference. First operand 5627 states and 12462 transitions. Second operand 9 states. [2019-11-15 21:15:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:07,534 INFO L93 Difference]: Finished difference Result 23110 states and 51805 transitions. [2019-11-15 21:15:07,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:15:07,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 21:15:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:07,555 INFO L225 Difference]: With dead ends: 23110 [2019-11-15 21:15:07,555 INFO L226 Difference]: Without dead ends: 13453 [2019-11-15 21:15:07,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:15:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13453 states. [2019-11-15 21:15:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13453 to 5373. [2019-11-15 21:15:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5373 states. [2019-11-15 21:15:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5373 states to 5373 states and 11791 transitions. [2019-11-15 21:15:07,699 INFO L78 Accepts]: Start accepts. Automaton has 5373 states and 11791 transitions. Word has length 95 [2019-11-15 21:15:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:07,699 INFO L462 AbstractCegarLoop]: Abstraction has 5373 states and 11791 transitions. [2019-11-15 21:15:07,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:15:07,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5373 states and 11791 transitions. [2019-11-15 21:15:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:15:07,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:07,706 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] [2019-11-15 21:15:07,707 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1759409356, now seen corresponding path program 1 times [2019-11-15 21:15:07,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:07,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013723607] [2019-11-15 21:15:07,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:07,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:07,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:07,848 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 21:15:07,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013723607] [2019-11-15 21:15:07,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:07,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:15:07,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028486196] [2019-11-15 21:15:07,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:15:07,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:07,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:07,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:07,850 INFO L87 Difference]: Start difference. First operand 5373 states and 11791 transitions. Second operand 6 states. [2019-11-15 21:15:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:08,132 INFO L93 Difference]: Finished difference Result 5898 states and 12759 transitions. [2019-11-15 21:15:08,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:15:08,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 21:15:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:08,140 INFO L225 Difference]: With dead ends: 5898 [2019-11-15 21:15:08,140 INFO L226 Difference]: Without dead ends: 5860 [2019-11-15 21:15:08,140 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:15:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2019-11-15 21:15:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 5284. [2019-11-15 21:15:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5284 states. [2019-11-15 21:15:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5284 states to 5284 states and 11487 transitions. [2019-11-15 21:15:08,225 INFO L78 Accepts]: Start accepts. Automaton has 5284 states and 11487 transitions. Word has length 95 [2019-11-15 21:15:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:08,225 INFO L462 AbstractCegarLoop]: Abstraction has 5284 states and 11487 transitions. [2019-11-15 21:15:08,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:15:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5284 states and 11487 transitions. [2019-11-15 21:15:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:15:08,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:08,232 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] [2019-11-15 21:15:08,232 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:08,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:08,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1556714004, now seen corresponding path program 2 times [2019-11-15 21:15:08,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:08,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745521258] [2019-11-15 21:15:08,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,341 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 21:15:08,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745521258] [2019-11-15 21:15:08,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:08,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:15:08,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878343490] [2019-11-15 21:15:08,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:15:08,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:08,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:08,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:08,343 INFO L87 Difference]: Start difference. First operand 5284 states and 11487 transitions. Second operand 6 states. [2019-11-15 21:15:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:08,584 INFO L93 Difference]: Finished difference Result 5706 states and 12348 transitions. [2019-11-15 21:15:08,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:15:08,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 21:15:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:08,592 INFO L225 Difference]: With dead ends: 5706 [2019-11-15 21:15:08,593 INFO L226 Difference]: Without dead ends: 5706 [2019-11-15 21:15:08,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:15:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2019-11-15 21:15:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5258. [2019-11-15 21:15:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5258 states. [2019-11-15 21:15:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 11418 transitions. [2019-11-15 21:15:08,679 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 11418 transitions. Word has length 95 [2019-11-15 21:15:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:08,679 INFO L462 AbstractCegarLoop]: Abstraction has 5258 states and 11418 transitions. [2019-11-15 21:15:08,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:15:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 11418 transitions. [2019-11-15 21:15:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:15:08,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:08,687 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] [2019-11-15 21:15:08,687 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash -33928459, now seen corresponding path program 2 times [2019-11-15 21:15:08,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:08,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421253533] [2019-11-15 21:15:08,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,860 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 21:15:08,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421253533] [2019-11-15 21:15:08,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:08,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:15:08,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507443804] [2019-11-15 21:15:08,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:15:08,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:15:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:15:08,863 INFO L87 Difference]: Start difference. First operand 5258 states and 11418 transitions. Second operand 7 states. [2019-11-15 21:15:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:08,974 INFO L93 Difference]: Finished difference Result 8977 states and 19607 transitions. [2019-11-15 21:15:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:15:08,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 21:15:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:08,979 INFO L225 Difference]: With dead ends: 8977 [2019-11-15 21:15:08,979 INFO L226 Difference]: Without dead ends: 3907 [2019-11-15 21:15:08,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:15:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2019-11-15 21:15:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3907. [2019-11-15 21:15:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3907 states. [2019-11-15 21:15:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 8543 transitions. [2019-11-15 21:15:09,030 INFO L78 Accepts]: Start accepts. Automaton has 3907 states and 8543 transitions. Word has length 95 [2019-11-15 21:15:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:09,030 INFO L462 AbstractCegarLoop]: Abstraction has 3907 states and 8543 transitions. [2019-11-15 21:15:09,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:15:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 8543 transitions. [2019-11-15 21:15:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:15:09,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:09,035 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] [2019-11-15 21:15:09,036 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2036673643, now seen corresponding path program 3 times [2019-11-15 21:15:09,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:09,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287986546] [2019-11-15 21:15:09,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:09,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:09,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:09,243 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 21:15:09,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287986546] [2019-11-15 21:15:09,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:09,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:15:09,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269776513] [2019-11-15 21:15:09,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:15:09,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:09,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:15:09,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:15:09,246 INFO L87 Difference]: Start difference. First operand 3907 states and 8543 transitions. Second operand 10 states. [2019-11-15 21:15:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:09,698 INFO L93 Difference]: Finished difference Result 7191 states and 15796 transitions. [2019-11-15 21:15:09,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:15:09,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 21:15:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:09,705 INFO L225 Difference]: With dead ends: 7191 [2019-11-15 21:15:09,705 INFO L226 Difference]: Without dead ends: 4778 [2019-11-15 21:15:09,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:15:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2019-11-15 21:15:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 3877. [2019-11-15 21:15:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3877 states. [2019-11-15 21:15:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 8477 transitions. [2019-11-15 21:15:09,773 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 8477 transitions. Word has length 95 [2019-11-15 21:15:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:09,774 INFO L462 AbstractCegarLoop]: Abstraction has 3877 states and 8477 transitions. [2019-11-15 21:15:09,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:15:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 8477 transitions. [2019-11-15 21:15:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:15:09,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:09,779 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] [2019-11-15 21:15:09,779 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash 230804873, now seen corresponding path program 4 times [2019-11-15 21:15:09,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:09,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491801314] [2019-11-15 21:15:09,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:09,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:09,895 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:09,895 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:15:10,076 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:15:10,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:15:10 BasicIcfg [2019-11-15 21:15:10,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:15:10,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:15:10,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:15:10,078 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:15:10,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:25" (3/4) ... [2019-11-15 21:15:10,081 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:15:10,259 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9913e572-bb58-4ab7-83d3-6bb3280c036b/bin/uautomizer/witness.graphml [2019-11-15 21:15:10,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:15:10,261 INFO L168 Benchmark]: Toolchain (without parser) took 46789.31 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 944.7 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 21:15:10,262 INFO L168 Benchmark]: CDTParser took 0.34 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 21:15:10,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:10,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:10,264 INFO L168 Benchmark]: Boogie Preprocessor took 46.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:15:10,264 INFO L168 Benchmark]: RCFGBuilder took 996.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:10,265 INFO L168 Benchmark]: TraceAbstraction took 44764.18 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 21:15:10,265 INFO L168 Benchmark]: Witness Printer took 180.99 ms. Allocated memory is still 4.7 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 73.8 MB). Peak memory consumption was 73.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:10,267 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.34 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 734.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 996.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44764.18 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 180.99 ms. Allocated memory is still 4.7 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 73.8 MB). Peak memory consumption was 73.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L796] 0 pthread_t t593; VAL [__unbuffered_cnt=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] [L797] FCALL, FORK 0 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L798] 0 pthread_t t594; VAL [__unbuffered_cnt=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] [L799] FCALL, FORK 0 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=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] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 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) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 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)) [L764] 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_p1_EAX=2, __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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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)) [L765] 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_p1_EAX=2, __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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 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)) [L766] 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_p1_EAX=2, __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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L767] 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_p1_EAX=2, __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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 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)) [L768] 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_p1_EAX=2, __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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 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=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L774] 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) [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 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 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 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 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 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) [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 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 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 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 [L812] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 44.6s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10293 SDtfs, 10595 SDslu, 24986 SDs, 0 SdLazy, 8454 SolverSat, 511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 113 SyntacticMatches, 23 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60245occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 90784 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2866 NumberOfCodeBlocks, 2866 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2734 ConstructedInterpolants, 0 QuantifiedInterpolants, 605002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...