./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/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 0ad75676076b2f4fd97a0e8b61d888447e8e32fb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:27:01,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:27:01,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:27:01,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:27:01,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:27:01,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:27:01,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:27:01,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:27:01,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:27:01,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:27:01,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:27:01,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:27:01,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:27:01,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:27:01,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:27:01,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:27:01,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:27:01,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:27:01,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:27:01,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:27:01,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:27:01,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:27:01,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:27:01,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:27:01,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:27:01,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:27:01,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:27:01,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:27:01,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:27:01,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:27:01,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:27:01,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:27:01,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:27:01,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:27:01,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:27:01,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:27:01,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:27:01,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:27:01,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:27:01,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:27:01,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:27:01,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:27:01,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:27:01,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:27:01,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:27:01,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:27:01,565 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:27:01,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:27:01,566 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:27:01,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:27:01,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:27:01,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:27:01,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:27:01,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:27:01,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:27:01,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:27:01,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:27:01,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:27:01,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:27:01,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:27:01,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:27:01,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:27:01,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:27:01,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:27:01,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:27:01,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:27:01,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:27:01,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:27:01,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:27:01,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:27:01,573 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_33dbfd28-f6b5-458f-ab85-fb068120bcba/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 -> 0ad75676076b2f4fd97a0e8b61d888447e8e32fb [2019-11-15 21:27:01,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:27:01,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:27:01,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:27:01,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:27:01,666 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:27:01,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i [2019-11-15 21:27:01,745 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/data/f527e207c/ea383e62a4dd4597aaba9bc5f1eee6a5/FLAGd6cd351e7 [2019-11-15 21:27:02,332 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:27:02,333 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/sv-benchmarks/c/pthread-wmm/safe033_power.opt.i [2019-11-15 21:27:02,352 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/data/f527e207c/ea383e62a4dd4597aaba9bc5f1eee6a5/FLAGd6cd351e7 [2019-11-15 21:27:02,579 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/data/f527e207c/ea383e62a4dd4597aaba9bc5f1eee6a5 [2019-11-15 21:27:02,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:27:02,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:27:02,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:27:02,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:27:02,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:27:02,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:27:02" (1/1) ... [2019-11-15 21:27:02,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4c723c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:02, skipping insertion in model container [2019-11-15 21:27:02,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:27:02" (1/1) ... [2019-11-15 21:27:02,602 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:27:02,677 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:27:03,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:27:03,194 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:27:03,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:27:03,402 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:27:03,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03 WrapperNode [2019-11-15 21:27:03,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:27:03,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:27:03,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:27:03,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:27:03,419 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:27:03" (1/1) ... [2019-11-15 21:27:03,439 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:27:03" (1/1) ... [2019-11-15 21:27:03,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:27:03,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:27:03,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:27:03,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:27:03,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (1/1) ... [2019-11-15 21:27:03,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (1/1) ... [2019-11-15 21:27:03,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (1/1) ... [2019-11-15 21:27:03,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (1/1) ... [2019-11-15 21:27:03,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (1/1) ... [2019-11-15 21:27:03,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (1/1) ... [2019-11-15 21:27:03,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (1/1) ... [2019-11-15 21:27:03,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:27:03,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:27:03,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:27:03,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:27:03,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/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:27:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:27:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:27:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:27:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:27:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:27:03,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:27:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:27:03,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:27:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:27:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:27:03,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:27:03,697 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:27:04,474 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:27:04,474 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:27:04,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:04 BoogieIcfgContainer [2019-11-15 21:27:04,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:27:04,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:27:04,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:27:04,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:27:04,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:27:02" (1/3) ... [2019-11-15 21:27:04,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3adf04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:27:04, skipping insertion in model container [2019-11-15 21:27:04,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:27:03" (2/3) ... [2019-11-15 21:27:04,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3adf04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:27:04, skipping insertion in model container [2019-11-15 21:27:04,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:04" (3/3) ... [2019-11-15 21:27:04,484 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.opt.i [2019-11-15 21:27:04,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,532 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,532 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,545 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,545 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,545 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,545 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,546 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,546 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,546 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,546 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,546 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,547 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,547 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,547 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,547 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,548 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,548 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,548 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,548 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,548 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,550 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,550 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,550 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,550 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,553 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,553 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,554 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,554 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,554 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:27:04,569 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:27:04,569 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:27:04,579 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:27:04,592 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:27:04,614 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:27:04,614 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:27:04,614 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:27:04,615 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:27:04,615 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:27:04,615 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:27:04,615 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:27:04,615 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:27:04,630 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 127 places, 159 transitions [2019-11-15 21:27:07,327 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25973 states. [2019-11-15 21:27:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 25973 states. [2019-11-15 21:27:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:27:07,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:07,346 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:07,353 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:07,360 INFO L82 PathProgramCache]: Analyzing trace with hash 531989487, now seen corresponding path program 1 times [2019-11-15 21:27:07,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:07,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685553578] [2019-11-15 21:27:07,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:07,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:07,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:07,679 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:27:07,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685553578] [2019-11-15 21:27:07,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:07,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:27:07,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029773787] [2019-11-15 21:27:07,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:27:07,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:07,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:27:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:27:07,714 INFO L87 Difference]: Start difference. First operand 25973 states. Second operand 4 states. [2019-11-15 21:27:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:08,517 INFO L93 Difference]: Finished difference Result 26613 states and 102118 transitions. [2019-11-15 21:27:08,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:27:08,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 21:27:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:08,842 INFO L225 Difference]: With dead ends: 26613 [2019-11-15 21:27:08,842 INFO L226 Difference]: Without dead ends: 20357 [2019-11-15 21:27:08,846 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:27:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20357 states. [2019-11-15 21:27:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20357 to 20357. [2019-11-15 21:27:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20357 states. [2019-11-15 21:27:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20357 states to 20357 states and 78422 transitions. [2019-11-15 21:27:10,355 INFO L78 Accepts]: Start accepts. Automaton has 20357 states and 78422 transitions. Word has length 36 [2019-11-15 21:27:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:10,356 INFO L462 AbstractCegarLoop]: Abstraction has 20357 states and 78422 transitions. [2019-11-15 21:27:10,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:27:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 20357 states and 78422 transitions. [2019-11-15 21:27:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:27:10,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:10,374 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:10,374 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash 998522529, now seen corresponding path program 1 times [2019-11-15 21:27:10,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:10,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088457200] [2019-11-15 21:27:10,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:10,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:10,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:10,509 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:27:10,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088457200] [2019-11-15 21:27:10,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:10,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:27:10,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876993075] [2019-11-15 21:27:10,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:27:10,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:10,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:10,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:10,513 INFO L87 Difference]: Start difference. First operand 20357 states and 78422 transitions. Second operand 5 states. [2019-11-15 21:27:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:11,831 INFO L93 Difference]: Finished difference Result 31835 states and 116039 transitions. [2019-11-15 21:27:11,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:11,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 21:27:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:12,002 INFO L225 Difference]: With dead ends: 31835 [2019-11-15 21:27:12,003 INFO L226 Difference]: Without dead ends: 31283 [2019-11-15 21:27:12,004 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:27:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31283 states. [2019-11-15 21:27:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31283 to 29702. [2019-11-15 21:27:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29702 states. [2019-11-15 21:27:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29702 states to 29702 states and 109516 transitions. [2019-11-15 21:27:13,535 INFO L78 Accepts]: Start accepts. Automaton has 29702 states and 109516 transitions. Word has length 44 [2019-11-15 21:27:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:13,537 INFO L462 AbstractCegarLoop]: Abstraction has 29702 states and 109516 transitions. [2019-11-15 21:27:13,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:27:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 29702 states and 109516 transitions. [2019-11-15 21:27:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:27:13,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:13,546 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:27:13,547 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash -192170192, now seen corresponding path program 1 times [2019-11-15 21:27:13,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:13,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326011798] [2019-11-15 21:27:13,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:13,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:13,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:13,650 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:27:13,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326011798] [2019-11-15 21:27:13,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:13,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:27:13,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443271912] [2019-11-15 21:27:13,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:27:13,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:13,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:13,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:13,653 INFO L87 Difference]: Start difference. First operand 29702 states and 109516 transitions. Second operand 5 states. [2019-11-15 21:27:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:14,755 INFO L93 Difference]: Finished difference Result 38693 states and 139688 transitions. [2019-11-15 21:27:14,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:14,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 21:27:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:14,940 INFO L225 Difference]: With dead ends: 38693 [2019-11-15 21:27:14,941 INFO L226 Difference]: Without dead ends: 38245 [2019-11-15 21:27:14,941 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:27:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38245 states. [2019-11-15 21:27:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38245 to 32948. [2019-11-15 21:27:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32948 states. [2019-11-15 21:27:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32948 states to 32948 states and 120525 transitions. [2019-11-15 21:27:16,016 INFO L78 Accepts]: Start accepts. Automaton has 32948 states and 120525 transitions. Word has length 45 [2019-11-15 21:27:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:16,016 INFO L462 AbstractCegarLoop]: Abstraction has 32948 states and 120525 transitions. [2019-11-15 21:27:16,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:27:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 32948 states and 120525 transitions. [2019-11-15 21:27:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:27:16,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:16,025 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:16,025 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1923602230, now seen corresponding path program 1 times [2019-11-15 21:27:16,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:16,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132805382] [2019-11-15 21:27:16,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:16,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:16,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:16,109 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:27:16,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132805382] [2019-11-15 21:27:16,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:16,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:27:16,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436847093] [2019-11-15 21:27:16,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:27:16,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:16,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:27:16,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:27:16,111 INFO L87 Difference]: Start difference. First operand 32948 states and 120525 transitions. Second operand 3 states. [2019-11-15 21:27:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:16,409 INFO L93 Difference]: Finished difference Result 42409 states and 152016 transitions. [2019-11-15 21:27:16,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:27:16,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-15 21:27:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:16,563 INFO L225 Difference]: With dead ends: 42409 [2019-11-15 21:27:16,564 INFO L226 Difference]: Without dead ends: 42409 [2019-11-15 21:27:16,564 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:27:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42409 states. [2019-11-15 21:27:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42409 to 37662. [2019-11-15 21:27:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37662 states. [2019-11-15 21:27:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37662 states to 37662 states and 136329 transitions. [2019-11-15 21:27:18,158 INFO L78 Accepts]: Start accepts. Automaton has 37662 states and 136329 transitions. Word has length 47 [2019-11-15 21:27:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:18,159 INFO L462 AbstractCegarLoop]: Abstraction has 37662 states and 136329 transitions. [2019-11-15 21:27:18,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:27:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 37662 states and 136329 transitions. [2019-11-15 21:27:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:27:18,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:18,176 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:18,177 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash -629683857, now seen corresponding path program 1 times [2019-11-15 21:27:18,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:18,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587855918] [2019-11-15 21:27:18,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:18,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:18,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:18,295 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:27:18,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587855918] [2019-11-15 21:27:18,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:18,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:18,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083072437] [2019-11-15 21:27:18,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:18,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:18,300 INFO L87 Difference]: Start difference. First operand 37662 states and 136329 transitions. Second operand 6 states. [2019-11-15 21:27:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:19,168 INFO L93 Difference]: Finished difference Result 48753 states and 172978 transitions. [2019-11-15 21:27:19,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:27:19,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 21:27:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:19,328 INFO L225 Difference]: With dead ends: 48753 [2019-11-15 21:27:19,329 INFO L226 Difference]: Without dead ends: 48233 [2019-11-15 21:27:19,330 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:27:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48233 states. [2019-11-15 21:27:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48233 to 38226. [2019-11-15 21:27:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38226 states. [2019-11-15 21:27:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38226 states to 38226 states and 138492 transitions. [2019-11-15 21:27:20,792 INFO L78 Accepts]: Start accepts. Automaton has 38226 states and 138492 transitions. Word has length 51 [2019-11-15 21:27:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:20,792 INFO L462 AbstractCegarLoop]: Abstraction has 38226 states and 138492 transitions. [2019-11-15 21:27:20,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:27:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 38226 states and 138492 transitions. [2019-11-15 21:27:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:27:20,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:20,811 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:20,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:20,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:20,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1938707736, now seen corresponding path program 1 times [2019-11-15 21:27:20,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:20,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704780481] [2019-11-15 21:27:20,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:20,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:20,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:20,971 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:27:20,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704780481] [2019-11-15 21:27:20,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:20,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:20,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792994115] [2019-11-15 21:27:20,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:20,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:20,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:20,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:20,974 INFO L87 Difference]: Start difference. First operand 38226 states and 138492 transitions. Second operand 6 states. [2019-11-15 21:27:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:21,936 INFO L93 Difference]: Finished difference Result 53002 states and 189568 transitions. [2019-11-15 21:27:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:21,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 21:27:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:22,066 INFO L225 Difference]: With dead ends: 53002 [2019-11-15 21:27:22,066 INFO L226 Difference]: Without dead ends: 52026 [2019-11-15 21:27:22,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:27:22,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52026 states. [2019-11-15 21:27:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52026 to 48779. [2019-11-15 21:27:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48779 states. [2019-11-15 21:27:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48779 states to 48779 states and 175223 transitions. [2019-11-15 21:27:23,142 INFO L78 Accepts]: Start accepts. Automaton has 48779 states and 175223 transitions. Word has length 51 [2019-11-15 21:27:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:23,142 INFO L462 AbstractCegarLoop]: Abstraction has 48779 states and 175223 transitions. [2019-11-15 21:27:23,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:27:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 48779 states and 175223 transitions. [2019-11-15 21:27:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:27:23,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:23,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:23,162 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash 559308201, now seen corresponding path program 1 times [2019-11-15 21:27:23,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:23,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411242953] [2019-11-15 21:27:23,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:23,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:23,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:23,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:27:23,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411242953] [2019-11-15 21:27:23,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:23,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:27:23,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233022850] [2019-11-15 21:27:23,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:27:23,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:23,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:27:23,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:27:23,321 INFO L87 Difference]: Start difference. First operand 48779 states and 175223 transitions. Second operand 7 states. [2019-11-15 21:27:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:25,047 INFO L93 Difference]: Finished difference Result 70894 states and 244520 transitions. [2019-11-15 21:27:25,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:27:25,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-15 21:27:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:25,212 INFO L225 Difference]: With dead ends: 70894 [2019-11-15 21:27:25,212 INFO L226 Difference]: Without dead ends: 70894 [2019-11-15 21:27:25,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:27:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70894 states. [2019-11-15 21:27:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70894 to 57887. [2019-11-15 21:27:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57887 states. [2019-11-15 21:27:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57887 states to 57887 states and 203147 transitions. [2019-11-15 21:27:26,521 INFO L78 Accepts]: Start accepts. Automaton has 57887 states and 203147 transitions. Word has length 51 [2019-11-15 21:27:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:26,521 INFO L462 AbstractCegarLoop]: Abstraction has 57887 states and 203147 transitions. [2019-11-15 21:27:26,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:27:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 57887 states and 203147 transitions. [2019-11-15 21:27:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:27:26,537 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:26,537 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:26,537 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1446811882, now seen corresponding path program 1 times [2019-11-15 21:27:26,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:26,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580262532] [2019-11-15 21:27:26,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:26,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:26,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:26,671 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:27:26,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580262532] [2019-11-15 21:27:26,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:26,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:27:26,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582700726] [2019-11-15 21:27:26,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:27:26,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:26,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:26,674 INFO L87 Difference]: Start difference. First operand 57887 states and 203147 transitions. Second operand 5 states. [2019-11-15 21:27:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:26,765 INFO L93 Difference]: Finished difference Result 10857 states and 33392 transitions. [2019-11-15 21:27:26,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:27:26,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-15 21:27:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:26,780 INFO L225 Difference]: With dead ends: 10857 [2019-11-15 21:27:26,781 INFO L226 Difference]: Without dead ends: 9358 [2019-11-15 21:27:26,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:27:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9358 states. [2019-11-15 21:27:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9358 to 9310. [2019-11-15 21:27:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9310 states. [2019-11-15 21:27:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9310 states to 9310 states and 28342 transitions. [2019-11-15 21:27:26,905 INFO L78 Accepts]: Start accepts. Automaton has 9310 states and 28342 transitions. Word has length 51 [2019-11-15 21:27:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:26,905 INFO L462 AbstractCegarLoop]: Abstraction has 9310 states and 28342 transitions. [2019-11-15 21:27:26,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:27:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 9310 states and 28342 transitions. [2019-11-15 21:27:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:27:26,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:26,911 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] [2019-11-15 21:27:26,911 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1556006386, now seen corresponding path program 1 times [2019-11-15 21:27:26,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:26,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559568768] [2019-11-15 21:27:26,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:26,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:26,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:26,971 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:27:26,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559568768] [2019-11-15 21:27:26,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:26,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:27:26,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028537718] [2019-11-15 21:27:26,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:27:26,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:26,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:27:26,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:27:26,973 INFO L87 Difference]: Start difference. First operand 9310 states and 28342 transitions. Second operand 4 states. [2019-11-15 21:27:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:27,144 INFO L93 Difference]: Finished difference Result 10885 states and 33034 transitions. [2019-11-15 21:27:27,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:27:27,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 21:27:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:27,165 INFO L225 Difference]: With dead ends: 10885 [2019-11-15 21:27:27,165 INFO L226 Difference]: Without dead ends: 10885 [2019-11-15 21:27:27,166 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:27:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2019-11-15 21:27:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 9877. [2019-11-15 21:27:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-11-15 21:27:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 30013 transitions. [2019-11-15 21:27:27,407 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 30013 transitions. Word has length 61 [2019-11-15 21:27:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:27,407 INFO L462 AbstractCegarLoop]: Abstraction has 9877 states and 30013 transitions. [2019-11-15 21:27:27,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:27:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 30013 transitions. [2019-11-15 21:27:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:27:27,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:27,414 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] [2019-11-15 21:27:27,414 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash 186803949, now seen corresponding path program 1 times [2019-11-15 21:27:27,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:27,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579439041] [2019-11-15 21:27:27,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:27,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:27,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:27,547 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:27:27,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579439041] [2019-11-15 21:27:27,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:27,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:27,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513388566] [2019-11-15 21:27:27,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:27,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:27,551 INFO L87 Difference]: Start difference. First operand 9877 states and 30013 transitions. Second operand 6 states. [2019-11-15 21:27:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:28,218 INFO L93 Difference]: Finished difference Result 12783 states and 38223 transitions. [2019-11-15 21:27:28,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:27:28,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 21:27:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:28,246 INFO L225 Difference]: With dead ends: 12783 [2019-11-15 21:27:28,247 INFO L226 Difference]: Without dead ends: 12735 [2019-11-15 21:27:28,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:27:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12735 states. [2019-11-15 21:27:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12735 to 10616. [2019-11-15 21:27:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10616 states. [2019-11-15 21:27:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10616 states to 10616 states and 32066 transitions. [2019-11-15 21:27:28,517 INFO L78 Accepts]: Start accepts. Automaton has 10616 states and 32066 transitions. Word has length 61 [2019-11-15 21:27:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:28,518 INFO L462 AbstractCegarLoop]: Abstraction has 10616 states and 32066 transitions. [2019-11-15 21:27:28,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:27:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 10616 states and 32066 transitions. [2019-11-15 21:27:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:27:28,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:28,549 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:28,551 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash -45655302, now seen corresponding path program 1 times [2019-11-15 21:27:28,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:28,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898400290] [2019-11-15 21:27:28,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:28,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:28,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:28,661 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:27:28,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898400290] [2019-11-15 21:27:28,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:28,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:27:28,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459865285] [2019-11-15 21:27:28,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:27:28,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:27:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:27:28,663 INFO L87 Difference]: Start difference. First operand 10616 states and 32066 transitions. Second operand 4 states. [2019-11-15 21:27:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:29,030 INFO L93 Difference]: Finished difference Result 13318 states and 39668 transitions. [2019-11-15 21:27:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:27:29,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 21:27:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:29,058 INFO L225 Difference]: With dead ends: 13318 [2019-11-15 21:27:29,059 INFO L226 Difference]: Without dead ends: 13318 [2019-11-15 21:27:29,059 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:27:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13318 states. [2019-11-15 21:27:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13318 to 12172. [2019-11-15 21:27:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12172 states. [2019-11-15 21:27:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12172 states to 12172 states and 36357 transitions. [2019-11-15 21:27:29,307 INFO L78 Accepts]: Start accepts. Automaton has 12172 states and 36357 transitions. Word has length 63 [2019-11-15 21:27:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:29,307 INFO L462 AbstractCegarLoop]: Abstraction has 12172 states and 36357 transitions. [2019-11-15 21:27:29,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:27:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 12172 states and 36357 transitions. [2019-11-15 21:27:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:27:29,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:29,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:29,324 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2122864645, now seen corresponding path program 1 times [2019-11-15 21:27:29,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:29,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101662753] [2019-11-15 21:27:29,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:29,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:29,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:29,368 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:27:29,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101662753] [2019-11-15 21:27:29,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:29,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:27:29,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063444588] [2019-11-15 21:27:29,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:27:29,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:29,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:27:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:27:29,370 INFO L87 Difference]: Start difference. First operand 12172 states and 36357 transitions. Second operand 3 states. [2019-11-15 21:27:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:29,594 INFO L93 Difference]: Finished difference Result 12698 states and 37762 transitions. [2019-11-15 21:27:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:27:29,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 21:27:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:29,614 INFO L225 Difference]: With dead ends: 12698 [2019-11-15 21:27:29,614 INFO L226 Difference]: Without dead ends: 12698 [2019-11-15 21:27:29,615 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:27:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12698 states. [2019-11-15 21:27:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12698 to 12460. [2019-11-15 21:27:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12460 states. [2019-11-15 21:27:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 37121 transitions. [2019-11-15 21:27:29,808 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 37121 transitions. Word has length 63 [2019-11-15 21:27:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:29,808 INFO L462 AbstractCegarLoop]: Abstraction has 12460 states and 37121 transitions. [2019-11-15 21:27:29,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:27:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 37121 transitions. [2019-11-15 21:27:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:27:29,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:29,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:29,826 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash -40717626, now seen corresponding path program 1 times [2019-11-15 21:27:29,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:29,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424510331] [2019-11-15 21:27:29,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:29,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:29,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:29,977 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:27:29,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424510331] [2019-11-15 21:27:29,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:29,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:29,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979493593] [2019-11-15 21:27:29,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:29,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:29,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:29,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:29,981 INFO L87 Difference]: Start difference. First operand 12460 states and 37121 transitions. Second operand 6 states. [2019-11-15 21:27:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:30,572 INFO L93 Difference]: Finished difference Result 13731 states and 40360 transitions. [2019-11-15 21:27:30,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:30,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 21:27:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:30,592 INFO L225 Difference]: With dead ends: 13731 [2019-11-15 21:27:30,592 INFO L226 Difference]: Without dead ends: 13731 [2019-11-15 21:27:30,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:27:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13731 states. [2019-11-15 21:27:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13731 to 13245. [2019-11-15 21:27:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13245 states. [2019-11-15 21:27:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13245 states to 13245 states and 39076 transitions. [2019-11-15 21:27:30,773 INFO L78 Accepts]: Start accepts. Automaton has 13245 states and 39076 transitions. Word has length 65 [2019-11-15 21:27:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:30,774 INFO L462 AbstractCegarLoop]: Abstraction has 13245 states and 39076 transitions. [2019-11-15 21:27:30,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:27:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13245 states and 39076 transitions. [2019-11-15 21:27:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:27:30,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:30,788 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:30,788 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2117926969, now seen corresponding path program 1 times [2019-11-15 21:27:30,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:30,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461891005] [2019-11-15 21:27:30,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:30,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:30,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:30,922 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:27:30,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461891005] [2019-11-15 21:27:30,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:30,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:30,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745502136] [2019-11-15 21:27:30,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:30,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:30,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:30,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:30,924 INFO L87 Difference]: Start difference. First operand 13245 states and 39076 transitions. Second operand 6 states. [2019-11-15 21:27:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:31,343 INFO L93 Difference]: Finished difference Result 15568 states and 44586 transitions. [2019-11-15 21:27:31,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:27:31,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 21:27:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:31,365 INFO L225 Difference]: With dead ends: 15568 [2019-11-15 21:27:31,365 INFO L226 Difference]: Without dead ends: 15568 [2019-11-15 21:27:31,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:27:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15568 states. [2019-11-15 21:27:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15568 to 13819. [2019-11-15 21:27:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13819 states. [2019-11-15 21:27:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13819 states to 13819 states and 39926 transitions. [2019-11-15 21:27:31,560 INFO L78 Accepts]: Start accepts. Automaton has 13819 states and 39926 transitions. Word has length 65 [2019-11-15 21:27:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:31,560 INFO L462 AbstractCegarLoop]: Abstraction has 13819 states and 39926 transitions. [2019-11-15 21:27:31,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:27:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 13819 states and 39926 transitions. [2019-11-15 21:27:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:27:31,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:31,573 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:31,573 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:31,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1906576056, now seen corresponding path program 1 times [2019-11-15 21:27:31,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:31,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132605437] [2019-11-15 21:27:31,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:31,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:31,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:31,655 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:27:31,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132605437] [2019-11-15 21:27:31,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:31,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:27:31,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343544358] [2019-11-15 21:27:31,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:27:31,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:31,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:31,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:31,658 INFO L87 Difference]: Start difference. First operand 13819 states and 39926 transitions. Second operand 5 states. [2019-11-15 21:27:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:31,984 INFO L93 Difference]: Finished difference Result 17380 states and 50005 transitions. [2019-11-15 21:27:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:27:31,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:27:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:32,009 INFO L225 Difference]: With dead ends: 17380 [2019-11-15 21:27:32,009 INFO L226 Difference]: Without dead ends: 17380 [2019-11-15 21:27:32,009 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:27:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17380 states. [2019-11-15 21:27:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17380 to 14857. [2019-11-15 21:27:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2019-11-15 21:27:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 42558 transitions. [2019-11-15 21:27:32,221 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 42558 transitions. Word has length 65 [2019-11-15 21:27:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:32,221 INFO L462 AbstractCegarLoop]: Abstraction has 14857 states and 42558 transitions. [2019-11-15 21:27:32,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:27:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 42558 transitions. [2019-11-15 21:27:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:27:32,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:32,231 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:32,231 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:32,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:32,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1877857063, now seen corresponding path program 1 times [2019-11-15 21:27:32,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:32,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369544327] [2019-11-15 21:27:32,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:32,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:32,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:32,307 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:27:32,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369544327] [2019-11-15 21:27:32,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:32,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:27:32,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074313138] [2019-11-15 21:27:32,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:27:32,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:32,309 INFO L87 Difference]: Start difference. First operand 14857 states and 42558 transitions. Second operand 5 states. [2019-11-15 21:27:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:32,839 INFO L93 Difference]: Finished difference Result 19762 states and 56505 transitions. [2019-11-15 21:27:32,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:27:32,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:27:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:32,871 INFO L225 Difference]: With dead ends: 19762 [2019-11-15 21:27:32,871 INFO L226 Difference]: Without dead ends: 19762 [2019-11-15 21:27:32,872 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:27:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2019-11-15 21:27:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 15762. [2019-11-15 21:27:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15762 states. [2019-11-15 21:27:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15762 states to 15762 states and 45144 transitions. [2019-11-15 21:27:33,168 INFO L78 Accepts]: Start accepts. Automaton has 15762 states and 45144 transitions. Word has length 65 [2019-11-15 21:27:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:33,168 INFO L462 AbstractCegarLoop]: Abstraction has 15762 states and 45144 transitions. [2019-11-15 21:27:33,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:27:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 15762 states and 45144 transitions. [2019-11-15 21:27:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:27:33,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:33,178 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:33,178 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:33,178 INFO L82 PathProgramCache]: Analyzing trace with hash 70402600, now seen corresponding path program 1 times [2019-11-15 21:27:33,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:33,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955854822] [2019-11-15 21:27:33,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:33,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:33,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:33,248 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:27:33,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955854822] [2019-11-15 21:27:33,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:33,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:27:33,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117902240] [2019-11-15 21:27:33,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:27:33,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:27:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:27:33,251 INFO L87 Difference]: Start difference. First operand 15762 states and 45144 transitions. Second operand 4 states. [2019-11-15 21:27:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:33,928 INFO L93 Difference]: Finished difference Result 20658 states and 59352 transitions. [2019-11-15 21:27:33,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:27:33,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 21:27:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:33,968 INFO L225 Difference]: With dead ends: 20658 [2019-11-15 21:27:33,968 INFO L226 Difference]: Without dead ends: 20382 [2019-11-15 21:27:33,969 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:27:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20382 states. [2019-11-15 21:27:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20382 to 18945. [2019-11-15 21:27:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18945 states. [2019-11-15 21:27:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18945 states to 18945 states and 54433 transitions. [2019-11-15 21:27:34,635 INFO L78 Accepts]: Start accepts. Automaton has 18945 states and 54433 transitions. Word has length 65 [2019-11-15 21:27:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:34,635 INFO L462 AbstractCegarLoop]: Abstraction has 18945 states and 54433 transitions. [2019-11-15 21:27:34,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:27:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 18945 states and 54433 transitions. [2019-11-15 21:27:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:27:34,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:34,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:34,652 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1726548759, now seen corresponding path program 1 times [2019-11-15 21:27:34,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:34,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476399242] [2019-11-15 21:27:34,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:34,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:34,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:34,805 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:27:34,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476399242] [2019-11-15 21:27:34,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:34,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:27:34,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241964900] [2019-11-15 21:27:34,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:27:34,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:27:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:27:34,808 INFO L87 Difference]: Start difference. First operand 18945 states and 54433 transitions. Second operand 7 states. [2019-11-15 21:27:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:35,317 INFO L93 Difference]: Finished difference Result 17839 states and 48887 transitions. [2019-11-15 21:27:35,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:27:35,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-15 21:27:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:35,340 INFO L225 Difference]: With dead ends: 17839 [2019-11-15 21:27:35,340 INFO L226 Difference]: Without dead ends: 17839 [2019-11-15 21:27:35,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:27:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17839 states. [2019-11-15 21:27:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17839 to 12473. [2019-11-15 21:27:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12473 states. [2019-11-15 21:27:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12473 states to 12473 states and 34350 transitions. [2019-11-15 21:27:35,537 INFO L78 Accepts]: Start accepts. Automaton has 12473 states and 34350 transitions. Word has length 65 [2019-11-15 21:27:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:35,538 INFO L462 AbstractCegarLoop]: Abstraction has 12473 states and 34350 transitions. [2019-11-15 21:27:35,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:27:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 12473 states and 34350 transitions. [2019-11-15 21:27:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:27:35,545 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:35,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:27:35,545 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:35,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:35,546 INFO L82 PathProgramCache]: Analyzing trace with hash -839045078, now seen corresponding path program 1 times [2019-11-15 21:27:35,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:35,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991442444] [2019-11-15 21:27:35,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:35,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:35,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:27:35,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991442444] [2019-11-15 21:27:35,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:35,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:27:35,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191629283] [2019-11-15 21:27:35,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:27:35,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:27:35,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:27:35,646 INFO L87 Difference]: Start difference. First operand 12473 states and 34350 transitions. Second operand 5 states. [2019-11-15 21:27:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:35,708 INFO L93 Difference]: Finished difference Result 4022 states and 9369 transitions. [2019-11-15 21:27:35,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:27:35,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:27:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:35,713 INFO L225 Difference]: With dead ends: 4022 [2019-11-15 21:27:35,713 INFO L226 Difference]: Without dead ends: 3349 [2019-11-15 21:27:35,714 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:27:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-11-15 21:27:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3089. [2019-11-15 21:27:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-11-15 21:27:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 7075 transitions. [2019-11-15 21:27:35,761 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 7075 transitions. Word has length 65 [2019-11-15 21:27:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:35,762 INFO L462 AbstractCegarLoop]: Abstraction has 3089 states and 7075 transitions. [2019-11-15 21:27:35,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:27:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 7075 transitions. [2019-11-15 21:27:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:27:35,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:35,767 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] [2019-11-15 21:27:35,767 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:35,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1377720652, now seen corresponding path program 1 times [2019-11-15 21:27:35,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:35,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764687194] [2019-11-15 21:27:35,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:35,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:35,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:35,935 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:27:35,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764687194] [2019-11-15 21:27:35,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:35,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:27:35,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885983372] [2019-11-15 21:27:35,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:27:35,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:27:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:27:35,938 INFO L87 Difference]: Start difference. First operand 3089 states and 7075 transitions. Second operand 7 states. [2019-11-15 21:27:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:36,528 INFO L93 Difference]: Finished difference Result 3728 states and 8436 transitions. [2019-11-15 21:27:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:27:36,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-15 21:27:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:36,532 INFO L225 Difference]: With dead ends: 3728 [2019-11-15 21:27:36,532 INFO L226 Difference]: Without dead ends: 3697 [2019-11-15 21:27:36,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:27:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-11-15 21:27:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3243. [2019-11-15 21:27:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3243 states. [2019-11-15 21:27:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 7398 transitions. [2019-11-15 21:27:36,568 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 7398 transitions. Word has length 82 [2019-11-15 21:27:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:36,568 INFO L462 AbstractCegarLoop]: Abstraction has 3243 states and 7398 transitions. [2019-11-15 21:27:36,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:27:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 7398 transitions. [2019-11-15 21:27:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:27:36,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:36,571 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] [2019-11-15 21:27:36,572 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:36,572 INFO L82 PathProgramCache]: Analyzing trace with hash 733569717, now seen corresponding path program 1 times [2019-11-15 21:27:36,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:36,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212868263] [2019-11-15 21:27:36,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:36,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:36,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:36,772 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:27:36,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212868263] [2019-11-15 21:27:36,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:36,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:27:36,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206762520] [2019-11-15 21:27:36,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:27:36,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:27:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:27:36,777 INFO L87 Difference]: Start difference. First operand 3243 states and 7398 transitions. Second operand 9 states. [2019-11-15 21:27:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:37,349 INFO L93 Difference]: Finished difference Result 11538 states and 26510 transitions. [2019-11-15 21:27:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:27:37,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-11-15 21:27:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:37,357 INFO L225 Difference]: With dead ends: 11538 [2019-11-15 21:27:37,357 INFO L226 Difference]: Without dead ends: 7339 [2019-11-15 21:27:37,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:27:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2019-11-15 21:27:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 3321. [2019-11-15 21:27:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2019-11-15 21:27:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 7546 transitions. [2019-11-15 21:27:37,408 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 7546 transitions. Word has length 82 [2019-11-15 21:27:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:37,408 INFO L462 AbstractCegarLoop]: Abstraction has 3321 states and 7546 transitions. [2019-11-15 21:27:37,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:27:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 7546 transitions. [2019-11-15 21:27:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:27:37,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:37,412 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] [2019-11-15 21:27:37,412 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:37,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1812519390, now seen corresponding path program 2 times [2019-11-15 21:27:37,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:37,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395844297] [2019-11-15 21:27:37,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:37,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:37,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:37,544 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:27:37,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395844297] [2019-11-15 21:27:37,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:37,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:27:37,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842652246] [2019-11-15 21:27:37,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:27:37,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:37,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:27:37,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:27:37,547 INFO L87 Difference]: Start difference. First operand 3321 states and 7546 transitions. Second operand 6 states. [2019-11-15 21:27:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:37,815 INFO L93 Difference]: Finished difference Result 3701 states and 8348 transitions. [2019-11-15 21:27:37,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:27:37,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-15 21:27:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:37,819 INFO L225 Difference]: With dead ends: 3701 [2019-11-15 21:27:37,819 INFO L226 Difference]: Without dead ends: 3629 [2019-11-15 21:27:37,819 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:27:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2019-11-15 21:27:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3104. [2019-11-15 21:27:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-11-15 21:27:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 7014 transitions. [2019-11-15 21:27:37,853 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 7014 transitions. Word has length 82 [2019-11-15 21:27:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:37,853 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 7014 transitions. [2019-11-15 21:27:37,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:27:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 7014 transitions. [2019-11-15 21:27:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:27:37,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:37,858 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] [2019-11-15 21:27:37,858 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1781499583, now seen corresponding path program 2 times [2019-11-15 21:27:37,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:37,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707557166] [2019-11-15 21:27:37,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:37,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:37,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:27:38,026 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:27:38,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707557166] [2019-11-15 21:27:38,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:27:38,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:27:38,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27658879] [2019-11-15 21:27:38,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:27:38,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:27:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:27:38,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:27:38,031 INFO L87 Difference]: Start difference. First operand 3104 states and 7014 transitions. Second operand 7 states. [2019-11-15 21:27:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:27:38,138 INFO L93 Difference]: Finished difference Result 5310 states and 12039 transitions. [2019-11-15 21:27:38,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:27:38,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-15 21:27:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:27:38,142 INFO L225 Difference]: With dead ends: 5310 [2019-11-15 21:27:38,142 INFO L226 Difference]: Without dead ends: 2294 [2019-11-15 21:27:38,142 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:27:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-11-15 21:27:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2294. [2019-11-15 21:27:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2294 states. [2019-11-15 21:27:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 5172 transitions. [2019-11-15 21:27:38,168 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 5172 transitions. Word has length 82 [2019-11-15 21:27:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:27:38,168 INFO L462 AbstractCegarLoop]: Abstraction has 2294 states and 5172 transitions. [2019-11-15 21:27:38,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:27:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 5172 transitions. [2019-11-15 21:27:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:27:38,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:27:38,170 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] [2019-11-15 21:27:38,170 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:27:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:27:38,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1233614151, now seen corresponding path program 3 times [2019-11-15 21:27:38,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:27:38,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337824565] [2019-11-15 21:27:38,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:27:38,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:27:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:27:38,263 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:27:38,264 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:27:38,402 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:27:38,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:27:38 BasicIcfg [2019-11-15 21:27:38,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:27:38,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:27:38,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:27:38,405 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:27:38,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:27:04" (3/4) ... [2019-11-15 21:27:38,408 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:27:38,579 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_33dbfd28-f6b5-458f-ab85-fb068120bcba/bin/uautomizer/witness.graphml [2019-11-15 21:27:38,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:27:38,582 INFO L168 Benchmark]: Toolchain (without parser) took 35995.91 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 946.1 MB in the beginning and 1.8 GB in the end (delta: -851.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:27:38,582 INFO L168 Benchmark]: CDTParser took 0.59 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:27:38,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:38,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:38,584 INFO L168 Benchmark]: Boogie Preprocessor took 104.38 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:27:38,584 INFO L168 Benchmark]: RCFGBuilder took 893.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:38,585 INFO L168 Benchmark]: TraceAbstraction took 33927.20 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -803.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 21:27:38,585 INFO L168 Benchmark]: Witness Printer took 174.65 ms. Allocated memory is still 3.2 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:27:38,587 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.59 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 822.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.38 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 893.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33927.20 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -803.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 174.65 ms. Allocated memory is still 3.2 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2563; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2563, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2564; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2564, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 193 locations, 3 error locations. Result: UNSAFE, OverallTime: 33.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6340 SDtfs, 7729 SDslu, 14169 SDs, 0 SdLazy, 5050 SolverSat, 392 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57887occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 63263 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1489 NumberOfCodeBlocks, 1489 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1384 ConstructedInterpolants, 0 QuantifiedInterpolants, 237443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...