./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/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 f5619558e548c3dd268cce0478a362a1364de920 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:46:04,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:46:04,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:46:04,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:46:04,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:46:04,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:46:04,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:46:04,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:46:04,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:46:04,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:46:04,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:46:04,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:46:04,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:46:04,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:46:04,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:46:04,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:46:04,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:46:04,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:46:04,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:46:04,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:46:04,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:46:04,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:46:04,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:46:04,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:46:04,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:46:04,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:46:04,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:46:04,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:46:04,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:46:04,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:46:04,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:46:04,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:46:04,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:46:04,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:46:04,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:46:04,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:46:04,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:46:04,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:46:04,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:46:04,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:46:04,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:46:04,423 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:46:04,454 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:46:04,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:46:04,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:46:04,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:46:04,456 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:46:04,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:46:04,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:46:04,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:46:04,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:46:04,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:46:04,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:46:04,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:46:04,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:46:04,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:46:04,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:46:04,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:46:04,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:46:04,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:46:04,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:46:04,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:46:04,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:46:04,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:46:04,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:46:04,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:46:04,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:46:04,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:46:04,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:46:04,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:46:04,462 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_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/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 -> f5619558e548c3dd268cce0478a362a1364de920 [2019-11-15 20:46:04,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:46:04,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:46:04,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:46:04,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:46:04,545 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:46:04,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc.i [2019-11-15 20:46:04,623 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/data/f6a39358d/826c896e71a84267a32a1cd6810b9f94/FLAG58d5ef98c [2019-11-15 20:46:05,222 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:46:05,223 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc.i [2019-11-15 20:46:05,249 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/data/f6a39358d/826c896e71a84267a32a1cd6810b9f94/FLAG58d5ef98c [2019-11-15 20:46:05,467 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/data/f6a39358d/826c896e71a84267a32a1cd6810b9f94 [2019-11-15 20:46:05,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:46:05,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:46:05,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:46:05,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:46:05,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:46:05,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:46:05" (1/1) ... [2019-11-15 20:46:05,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ef51e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:05, skipping insertion in model container [2019-11-15 20:46:05,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:46:05" (1/1) ... [2019-11-15 20:46:05,489 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:46:05,533 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:46:06,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:46:06,126 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:46:06,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:46:06,290 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:46:06,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06 WrapperNode [2019-11-15 20:46:06,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:46:06,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:46:06,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:46:06,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:46:06,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:46:06,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:46:06,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:46:06,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:46:06,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... [2019-11-15 20:46:06,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:46:06,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:46:06,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:46:06,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:46:06,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/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 20:46:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:46:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:46:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:46:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:46:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:46:06,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:46:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:46:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:46:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:46:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:46:06,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:46:06,559 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 20:46:07,385 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:46:07,385 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:46:07,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:46:07 BoogieIcfgContainer [2019-11-15 20:46:07,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:46:07,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:46:07,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:46:07,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:46:07,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:46:05" (1/3) ... [2019-11-15 20:46:07,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dd9105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:46:07, skipping insertion in model container [2019-11-15 20:46:07,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:06" (2/3) ... [2019-11-15 20:46:07,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dd9105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:46:07, skipping insertion in model container [2019-11-15 20:46:07,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:46:07" (3/3) ... [2019-11-15 20:46:07,395 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc.i [2019-11-15 20:46:07,457 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,457 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,457 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,457 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,457 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,458 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,458 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,458 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,458 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,459 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,459 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,459 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,459 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,459 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,460 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,460 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,460 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,460 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,460 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,460 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,461 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,461 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,461 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,461 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,461 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,462 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,462 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,462 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,462 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,462 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,463 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,463 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,463 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,463 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,464 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,465 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,465 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,465 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,465 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,465 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,466 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,466 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,466 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,466 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,467 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,467 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,467 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,467 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,467 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,468 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,468 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,468 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,468 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,468 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,469 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,469 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,469 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,469 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,470 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,470 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,470 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,470 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,471 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,471 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,471 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,471 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,471 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,472 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,472 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,472 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,472 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,473 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,473 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,473 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,473 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,473 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,474 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,474 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,474 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,474 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,475 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,475 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,475 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,475 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,476 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,476 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,476 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,476 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,476 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,476 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,477 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,477 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,477 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,477 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,478 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,479 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,480 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,480 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,480 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,480 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,480 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,482 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,483 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,484 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,484 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,484 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,485 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,486 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,486 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,487 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,488 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,489 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,489 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,489 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,490 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,490 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,491 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,491 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,492 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,492 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,492 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,492 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,493 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,493 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,493 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,493 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,494 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,494 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,494 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,494 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,495 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,495 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,495 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,495 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,496 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,496 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,496 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,496 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,497 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,497 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,497 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,497 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,498 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,498 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,498 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,498 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,499 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,499 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,499 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,499 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,500 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,500 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:46:07,511 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:46:07,512 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:46:07,524 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:46:07,537 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:46:07,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:46:07,562 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:46:07,563 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:46:07,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:46:07,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:46:07,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:46:07,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:46:07,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:46:07,581 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-15 20:46:10,688 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-11-15 20:46:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-11-15 20:46:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 20:46:10,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:10,701 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:10,706 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash -120544767, now seen corresponding path program 1 times [2019-11-15 20:46:10,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:10,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369315258] [2019-11-15 20:46:10,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:10,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:10,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,035 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 20:46:11,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369315258] [2019-11-15 20:46:11,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:11,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:11,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252772762] [2019-11-15 20:46:11,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:11,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:11,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:11,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:11,061 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-11-15 20:46:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:12,113 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-11-15 20:46:12,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:12,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 20:46:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:12,415 INFO L225 Difference]: With dead ends: 33591 [2019-11-15 20:46:12,415 INFO L226 Difference]: Without dead ends: 25703 [2019-11-15 20:46:12,417 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 20:46:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-11-15 20:46:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-11-15 20:46:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-11-15 20:46:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-11-15 20:46:14,453 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-11-15 20:46:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:14,454 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-11-15 20:46:14,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-11-15 20:46:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 20:46:14,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:14,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:14,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1401012243, now seen corresponding path program 1 times [2019-11-15 20:46:14,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:14,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002401520] [2019-11-15 20:46:14,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:14,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:14,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:14,680 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 20:46:14,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002401520] [2019-11-15 20:46:14,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:14,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:14,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414638604] [2019-11-15 20:46:14,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:14,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:14,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:14,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:14,685 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-11-15 20:46:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:16,059 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-11-15 20:46:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:46:16,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 20:46:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:16,267 INFO L225 Difference]: With dead ends: 41081 [2019-11-15 20:46:16,268 INFO L226 Difference]: Without dead ends: 40545 [2019-11-15 20:46:16,269 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 20:46:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-11-15 20:46:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-11-15 20:46:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-11-15 20:46:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-11-15 20:46:18,099 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-11-15 20:46:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:18,113 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-11-15 20:46:18,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:46:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-11-15 20:46:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 20:46:18,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:18,122 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 20:46:18,123 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:18,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash -168847436, now seen corresponding path program 1 times [2019-11-15 20:46:18,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:18,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973853825] [2019-11-15 20:46:18,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:18,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:18,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,263 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 20:46:18,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973853825] [2019-11-15 20:46:18,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:18,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:18,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890219289] [2019-11-15 20:46:18,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:18,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:18,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:18,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:18,266 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-11-15 20:46:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:18,945 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-11-15 20:46:18,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:46:18,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 20:46:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:19,243 INFO L225 Difference]: With dead ends: 49778 [2019-11-15 20:46:19,244 INFO L226 Difference]: Without dead ends: 49274 [2019-11-15 20:46:19,245 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 20:46:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-11-15 20:46:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-11-15 20:46:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-11-15 20:46:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-11-15 20:46:21,336 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-11-15 20:46:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:21,336 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-11-15 20:46:21,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:46:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-11-15 20:46:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 20:46:21,350 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:21,350 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:21,351 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1917601690, now seen corresponding path program 1 times [2019-11-15 20:46:21,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:21,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036226028] [2019-11-15 20:46:21,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:21,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:21,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:21,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036226028] [2019-11-15 20:46:21,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:21,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:46:21,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180113552] [2019-11-15 20:46:21,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:46:21,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:21,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:46:21,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:46:21,400 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-11-15 20:46:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:21,783 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-11-15 20:46:21,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:46:21,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 20:46:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:23,099 INFO L225 Difference]: With dead ends: 61087 [2019-11-15 20:46:23,099 INFO L226 Difference]: Without dead ends: 61087 [2019-11-15 20:46:23,100 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 20:46:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-11-15 20:46:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-11-15 20:46:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-11-15 20:46:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-11-15 20:46:24,486 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-11-15 20:46:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:24,486 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-11-15 20:46:24,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:46:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-11-15 20:46:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:46:24,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:24,504 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] [2019-11-15 20:46:24,505 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash -740471995, now seen corresponding path program 1 times [2019-11-15 20:46:24,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:24,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135907816] [2019-11-15 20:46:24,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:24,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:24,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,651 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 20:46:24,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135907816] [2019-11-15 20:46:24,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:24,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:46:24,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422863328] [2019-11-15 20:46:24,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:46:24,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:46:24,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:46:24,655 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-11-15 20:46:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:25,773 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-11-15 20:46:25,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:46:25,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 20:46:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:25,929 INFO L225 Difference]: With dead ends: 63756 [2019-11-15 20:46:25,929 INFO L226 Difference]: Without dead ends: 63756 [2019-11-15 20:46:25,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:46:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-11-15 20:46:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-11-15 20:46:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-11-15 20:46:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-11-15 20:46:28,469 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-11-15 20:46:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:28,470 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-11-15 20:46:28,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:46:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-11-15 20:46:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:46:28,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:28,493 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] [2019-11-15 20:46:28,493 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:28,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1757543942, now seen corresponding path program 1 times [2019-11-15 20:46:28,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:28,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327878112] [2019-11-15 20:46:28,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:28,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:28,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:28,692 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 20:46:28,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327878112] [2019-11-15 20:46:28,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:28,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:46:28,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692571006] [2019-11-15 20:46:28,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:46:28,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:28,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:46:28,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:28,694 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-11-15 20:46:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:30,363 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-11-15 20:46:30,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:46:30,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-15 20:46:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:30,605 INFO L225 Difference]: With dead ends: 83685 [2019-11-15 20:46:30,605 INFO L226 Difference]: Without dead ends: 83685 [2019-11-15 20:46:30,605 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 20:46:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-11-15 20:46:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-11-15 20:46:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-11-15 20:46:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-11-15 20:46:36,862 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-11-15 20:46:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:36,862 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-11-15 20:46:36,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:46:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-11-15 20:46:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:46:36,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:36,882 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] [2019-11-15 20:46:36,883 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:36,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:36,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1649919673, now seen corresponding path program 1 times [2019-11-15 20:46:36,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:36,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350562651] [2019-11-15 20:46:36,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:36,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:36,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:36,995 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 20:46:36,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350562651] [2019-11-15 20:46:36,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:36,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:36,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503292793] [2019-11-15 20:46:36,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:36,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:36,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:36,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:36,998 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 5 states. [2019-11-15 20:46:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:37,102 INFO L93 Difference]: Finished difference Result 12159 states and 37829 transitions. [2019-11-15 20:46:37,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:46:37,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-15 20:46:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:37,125 INFO L225 Difference]: With dead ends: 12159 [2019-11-15 20:46:37,125 INFO L226 Difference]: Without dead ends: 10674 [2019-11-15 20:46:37,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2019-11-15 20:46:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10625. [2019-11-15 20:46:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-11-15 20:46:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 32591 transitions. [2019-11-15 20:46:37,301 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 32591 transitions. Word has length 53 [2019-11-15 20:46:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:37,301 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 32591 transitions. [2019-11-15 20:46:37,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:46:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 32591 transitions. [2019-11-15 20:46:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:46:37,302 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:37,303 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:37,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -796322971, now seen corresponding path program 1 times [2019-11-15 20:46:37,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:37,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471746542] [2019-11-15 20:46:37,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:37,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:37,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:37,382 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 20:46:37,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471746542] [2019-11-15 20:46:37,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:37,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:46:37,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021382800] [2019-11-15 20:46:37,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:46:37,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:46:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:46:37,385 INFO L87 Difference]: Start difference. First operand 10625 states and 32591 transitions. Second operand 6 states. [2019-11-15 20:46:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:37,931 INFO L93 Difference]: Finished difference Result 13182 states and 39872 transitions. [2019-11-15 20:46:37,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:46:37,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 20:46:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:37,952 INFO L225 Difference]: With dead ends: 13182 [2019-11-15 20:46:37,952 INFO L226 Difference]: Without dead ends: 13119 [2019-11-15 20:46:37,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:46:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2019-11-15 20:46:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11048. [2019-11-15 20:46:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-11-15 20:46:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 33785 transitions. [2019-11-15 20:46:38,149 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 33785 transitions. Word has length 53 [2019-11-15 20:46:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:38,149 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 33785 transitions. [2019-11-15 20:46:38,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:46:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 33785 transitions. [2019-11-15 20:46:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 20:46:38,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:38,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:38,154 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:38,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash 458880321, now seen corresponding path program 1 times [2019-11-15 20:46:38,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:38,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928896263] [2019-11-15 20:46:38,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:38,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:38,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:38,238 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 20:46:38,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928896263] [2019-11-15 20:46:38,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:38,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:38,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540594842] [2019-11-15 20:46:38,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:38,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:38,243 INFO L87 Difference]: Start difference. First operand 11048 states and 33785 transitions. Second operand 4 states. [2019-11-15 20:46:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:38,435 INFO L93 Difference]: Finished difference Result 12862 states and 39391 transitions. [2019-11-15 20:46:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:46:38,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 20:46:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:38,465 INFO L225 Difference]: With dead ends: 12862 [2019-11-15 20:46:38,465 INFO L226 Difference]: Without dead ends: 12862 [2019-11-15 20:46:38,466 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 20:46:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2019-11-15 20:46:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 11693. [2019-11-15 20:46:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-11-15 20:46:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35762 transitions. [2019-11-15 20:46:38,663 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35762 transitions. Word has length 61 [2019-11-15 20:46:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:38,664 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35762 transitions. [2019-11-15 20:46:38,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35762 transitions. [2019-11-15 20:46:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 20:46:38,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:38,678 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 20:46:38,678 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:38,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:38,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2093276640, now seen corresponding path program 1 times [2019-11-15 20:46:38,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:38,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084470208] [2019-11-15 20:46:38,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:38,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:38,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:38,773 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 20:46:38,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084470208] [2019-11-15 20:46:38,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:38,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:46:38,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196280403] [2019-11-15 20:46:38,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:46:38,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:46:38,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:46:38,776 INFO L87 Difference]: Start difference. First operand 11693 states and 35762 transitions. Second operand 6 states. [2019-11-15 20:46:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:39,315 INFO L93 Difference]: Finished difference Result 14219 states and 42860 transitions. [2019-11-15 20:46:39,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:46:39,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 20:46:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:39,338 INFO L225 Difference]: With dead ends: 14219 [2019-11-15 20:46:39,339 INFO L226 Difference]: Without dead ends: 14158 [2019-11-15 20:46:39,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:46:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2019-11-15 20:46:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 13461. [2019-11-15 20:46:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13461 states. [2019-11-15 20:46:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 40779 transitions. [2019-11-15 20:46:39,588 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 40779 transitions. Word has length 61 [2019-11-15 20:46:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:39,588 INFO L462 AbstractCegarLoop]: Abstraction has 13461 states and 40779 transitions. [2019-11-15 20:46:39,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:46:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 40779 transitions. [2019-11-15 20:46:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:46:39,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:39,595 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 20:46:39,595 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1966202348, now seen corresponding path program 1 times [2019-11-15 20:46:39,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:39,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522890416] [2019-11-15 20:46:39,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:39,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:39,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:40,235 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 20:46:40,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522890416] [2019-11-15 20:46:40,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:40,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:40,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859872346] [2019-11-15 20:46:40,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:40,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:40,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:40,238 INFO L87 Difference]: Start difference. First operand 13461 states and 40779 transitions. Second operand 4 states. [2019-11-15 20:46:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:40,744 INFO L93 Difference]: Finished difference Result 18895 states and 55937 transitions. [2019-11-15 20:46:40,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:46:40,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 20:46:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:40,785 INFO L225 Difference]: With dead ends: 18895 [2019-11-15 20:46:40,785 INFO L226 Difference]: Without dead ends: 18847 [2019-11-15 20:46:40,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2019-11-15 20:46:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 14874. [2019-11-15 20:46:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14874 states. [2019-11-15 20:46:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14874 states to 14874 states and 44559 transitions. [2019-11-15 20:46:41,061 INFO L78 Accepts]: Start accepts. Automaton has 14874 states and 44559 transitions. Word has length 65 [2019-11-15 20:46:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:41,061 INFO L462 AbstractCegarLoop]: Abstraction has 14874 states and 44559 transitions. [2019-11-15 20:46:41,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 14874 states and 44559 transitions. [2019-11-15 20:46:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:46:41,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:41,069 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 20:46:41,070 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:41,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:41,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2033209101, now seen corresponding path program 1 times [2019-11-15 20:46:41,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:41,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549072611] [2019-11-15 20:46:41,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:41,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:41,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:41,143 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 20:46:41,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549072611] [2019-11-15 20:46:41,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:41,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:41,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141848176] [2019-11-15 20:46:41,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:41,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:41,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:41,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:41,145 INFO L87 Difference]: Start difference. First operand 14874 states and 44559 transitions. Second operand 4 states. [2019-11-15 20:46:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:41,515 INFO L93 Difference]: Finished difference Result 18169 states and 53762 transitions. [2019-11-15 20:46:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:41,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 20:46:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:41,544 INFO L225 Difference]: With dead ends: 18169 [2019-11-15 20:46:41,544 INFO L226 Difference]: Without dead ends: 18169 [2019-11-15 20:46:41,544 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 20:46:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2019-11-15 20:46:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 15114. [2019-11-15 20:46:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15114 states. [2019-11-15 20:46:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15114 states to 15114 states and 45207 transitions. [2019-11-15 20:46:41,787 INFO L78 Accepts]: Start accepts. Automaton has 15114 states and 45207 transitions. Word has length 65 [2019-11-15 20:46:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:41,787 INFO L462 AbstractCegarLoop]: Abstraction has 15114 states and 45207 transitions. [2019-11-15 20:46:41,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 15114 states and 45207 transitions. [2019-11-15 20:46:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:46:41,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:41,796 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 20:46:41,797 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2064228908, now seen corresponding path program 1 times [2019-11-15 20:46:41,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:41,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567728251] [2019-11-15 20:46:41,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:41,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:41,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:41,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567728251] [2019-11-15 20:46:41,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:41,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:46:41,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986207847] [2019-11-15 20:46:41,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:46:41,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:46:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:46:41,851 INFO L87 Difference]: Start difference. First operand 15114 states and 45207 transitions. Second operand 3 states. [2019-11-15 20:46:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:42,182 INFO L93 Difference]: Finished difference Result 15542 states and 46331 transitions. [2019-11-15 20:46:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:46:42,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-15 20:46:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:42,216 INFO L225 Difference]: With dead ends: 15542 [2019-11-15 20:46:42,216 INFO L226 Difference]: Without dead ends: 15542 [2019-11-15 20:46:42,217 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 20:46:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-11-15 20:46:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 15328. [2019-11-15 20:46:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-11-15 20:46:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 45749 transitions. [2019-11-15 20:46:42,516 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 45749 transitions. Word has length 65 [2019-11-15 20:46:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:42,516 INFO L462 AbstractCegarLoop]: Abstraction has 15328 states and 45749 transitions. [2019-11-15 20:46:42,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:46:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 45749 transitions. [2019-11-15 20:46:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:46:42,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:42,525 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] [2019-11-15 20:46:42,525 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:42,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1089808274, now seen corresponding path program 1 times [2019-11-15 20:46:42,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:42,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551831821] [2019-11-15 20:46:42,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:42,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:42,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:42,619 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 20:46:42,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551831821] [2019-11-15 20:46:42,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:42,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:46:42,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974522162] [2019-11-15 20:46:42,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:46:42,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:46:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:46:42,621 INFO L87 Difference]: Start difference. First operand 15328 states and 45749 transitions. Second operand 6 states. [2019-11-15 20:46:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:43,068 INFO L93 Difference]: Finished difference Result 16701 states and 48916 transitions. [2019-11-15 20:46:43,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:46:43,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 20:46:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:43,093 INFO L225 Difference]: With dead ends: 16701 [2019-11-15 20:46:43,093 INFO L226 Difference]: Without dead ends: 16701 [2019-11-15 20:46:43,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:46:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16701 states. [2019-11-15 20:46:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16701 to 15510. [2019-11-15 20:46:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15510 states. [2019-11-15 20:46:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 45935 transitions. [2019-11-15 20:46:43,317 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 45935 transitions. Word has length 67 [2019-11-15 20:46:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:43,317 INFO L462 AbstractCegarLoop]: Abstraction has 15510 states and 45935 transitions. [2019-11-15 20:46:43,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:46:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 45935 transitions. [2019-11-15 20:46:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:46:43,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:43,326 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] [2019-11-15 20:46:43,326 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:43,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:43,327 INFO L82 PathProgramCache]: Analyzing trace with hash -948248015, now seen corresponding path program 1 times [2019-11-15 20:46:43,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:43,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122563826] [2019-11-15 20:46:43,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:43,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:43,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:43,421 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 20:46:43,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122563826] [2019-11-15 20:46:43,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:43,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:43,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853585654] [2019-11-15 20:46:43,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:43,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:43,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:43,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:43,424 INFO L87 Difference]: Start difference. First operand 15510 states and 45935 transitions. Second operand 5 states. [2019-11-15 20:46:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:43,810 INFO L93 Difference]: Finished difference Result 19681 states and 57982 transitions. [2019-11-15 20:46:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:46:43,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 20:46:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:43,838 INFO L225 Difference]: With dead ends: 19681 [2019-11-15 20:46:43,839 INFO L226 Difference]: Without dead ends: 19681 [2019-11-15 20:46:43,839 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 20:46:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19681 states. [2019-11-15 20:46:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19681 to 18165. [2019-11-15 20:46:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-11-15 20:46:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 53469 transitions. [2019-11-15 20:46:44,104 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 53469 transitions. Word has length 67 [2019-11-15 20:46:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:44,104 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 53469 transitions. [2019-11-15 20:46:44,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:46:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 53469 transitions. [2019-11-15 20:46:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:46:44,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:44,116 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] [2019-11-15 20:46:44,116 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:44,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1458782192, now seen corresponding path program 1 times [2019-11-15 20:46:44,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:44,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129348826] [2019-11-15 20:46:44,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:44,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:44,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:44,206 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 20:46:44,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129348826] [2019-11-15 20:46:44,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:44,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:44,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151773838] [2019-11-15 20:46:44,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:44,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:44,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:44,208 INFO L87 Difference]: Start difference. First operand 18165 states and 53469 transitions. Second operand 5 states. [2019-11-15 20:46:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:44,838 INFO L93 Difference]: Finished difference Result 26550 states and 77182 transitions. [2019-11-15 20:46:44,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:46:44,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 20:46:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:44,878 INFO L225 Difference]: With dead ends: 26550 [2019-11-15 20:46:44,879 INFO L226 Difference]: Without dead ends: 26550 [2019-11-15 20:46:44,879 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 20:46:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26550 states. [2019-11-15 20:46:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26550 to 21618. [2019-11-15 20:46:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-11-15 20:46:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 62902 transitions. [2019-11-15 20:46:45,776 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 62902 transitions. Word has length 67 [2019-11-15 20:46:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:45,776 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 62902 transitions. [2019-11-15 20:46:45,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:46:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 62902 transitions. [2019-11-15 20:46:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:46:45,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:45,789 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] [2019-11-15 20:46:45,789 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1028730641, now seen corresponding path program 1 times [2019-11-15 20:46:45,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:45,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968251724] [2019-11-15 20:46:45,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:45,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:45,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:45,855 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 20:46:45,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968251724] [2019-11-15 20:46:45,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:45,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:45,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614116065] [2019-11-15 20:46:45,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:45,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:45,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:45,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:45,857 INFO L87 Difference]: Start difference. First operand 21618 states and 62902 transitions. Second operand 4 states. [2019-11-15 20:46:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:46,475 INFO L93 Difference]: Finished difference Result 28143 states and 82198 transitions. [2019-11-15 20:46:46,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:46:46,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 20:46:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:46,519 INFO L225 Difference]: With dead ends: 28143 [2019-11-15 20:46:46,519 INFO L226 Difference]: Without dead ends: 28008 [2019-11-15 20:46:46,520 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 20:46:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28008 states. [2019-11-15 20:46:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28008 to 26043. [2019-11-15 20:46:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26043 states. [2019-11-15 20:46:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26043 states to 26043 states and 76088 transitions. [2019-11-15 20:46:46,912 INFO L78 Accepts]: Start accepts. Automaton has 26043 states and 76088 transitions. Word has length 67 [2019-11-15 20:46:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:46,912 INFO L462 AbstractCegarLoop]: Abstraction has 26043 states and 76088 transitions. [2019-11-15 20:46:46,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26043 states and 76088 transitions. [2019-11-15 20:46:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:46:46,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:46,922 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] [2019-11-15 20:46:46,922 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -768220718, now seen corresponding path program 1 times [2019-11-15 20:46:46,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:46,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468957830] [2019-11-15 20:46:46,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:46,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:46,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:47,066 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 20:46:47,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468957830] [2019-11-15 20:46:47,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:47,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:46:47,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080016676] [2019-11-15 20:46:47,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:46:47,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:47,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:46:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:47,069 INFO L87 Difference]: Start difference. First operand 26043 states and 76088 transitions. Second operand 7 states. [2019-11-15 20:46:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:47,576 INFO L93 Difference]: Finished difference Result 23304 states and 65259 transitions. [2019-11-15 20:46:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:46:47,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-15 20:46:47,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:47,608 INFO L225 Difference]: With dead ends: 23304 [2019-11-15 20:46:47,608 INFO L226 Difference]: Without dead ends: 23304 [2019-11-15 20:46:47,608 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 20:46:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23304 states. [2019-11-15 20:46:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23304 to 19068. [2019-11-15 20:46:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19068 states. [2019-11-15 20:46:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19068 states to 19068 states and 53401 transitions. [2019-11-15 20:46:47,888 INFO L78 Accepts]: Start accepts. Automaton has 19068 states and 53401 transitions. Word has length 67 [2019-11-15 20:46:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:47,888 INFO L462 AbstractCegarLoop]: Abstraction has 19068 states and 53401 transitions. [2019-11-15 20:46:47,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:46:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 19068 states and 53401 transitions. [2019-11-15 20:46:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:46:47,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:47,896 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] [2019-11-15 20:46:47,896 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash 119282963, now seen corresponding path program 1 times [2019-11-15 20:46:47,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:47,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063728811] [2019-11-15 20:46:47,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:47,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:47,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:47,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063728811] [2019-11-15 20:46:47,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:47,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:47,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58451485] [2019-11-15 20:46:47,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:47,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:47,976 INFO L87 Difference]: Start difference. First operand 19068 states and 53401 transitions. Second operand 5 states. [2019-11-15 20:46:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:48,037 INFO L93 Difference]: Finished difference Result 5742 states and 13710 transitions. [2019-11-15 20:46:48,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:46:48,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 20:46:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:48,044 INFO L225 Difference]: With dead ends: 5742 [2019-11-15 20:46:48,044 INFO L226 Difference]: Without dead ends: 4764 [2019-11-15 20:46:48,045 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 20:46:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2019-11-15 20:46:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 3929. [2019-11-15 20:46:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-11-15 20:46:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 9180 transitions. [2019-11-15 20:46:48,109 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 9180 transitions. Word has length 67 [2019-11-15 20:46:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:48,110 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 9180 transitions. [2019-11-15 20:46:48,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:46:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 9180 transitions. [2019-11-15 20:46:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:46:48,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:48,115 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] [2019-11-15 20:46:48,115 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash -355085295, now seen corresponding path program 1 times [2019-11-15 20:46:48,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:48,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612352545] [2019-11-15 20:46:48,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:48,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:48,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:48,168 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 20:46:48,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612352545] [2019-11-15 20:46:48,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:48,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:46:48,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190143755] [2019-11-15 20:46:48,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:46:48,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:48,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:46:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:46:48,171 INFO L87 Difference]: Start difference. First operand 3929 states and 9180 transitions. Second operand 3 states. [2019-11-15 20:46:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:48,211 INFO L93 Difference]: Finished difference Result 4939 states and 11353 transitions. [2019-11-15 20:46:48,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:46:48,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 20:46:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:48,217 INFO L225 Difference]: With dead ends: 4939 [2019-11-15 20:46:48,218 INFO L226 Difference]: Without dead ends: 4939 [2019-11-15 20:46:48,218 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 20:46:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2019-11-15 20:46:48,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 3872. [2019-11-15 20:46:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3872 states. [2019-11-15 20:46:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 8827 transitions. [2019-11-15 20:46:48,285 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 8827 transitions. Word has length 67 [2019-11-15 20:46:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:48,285 INFO L462 AbstractCegarLoop]: Abstraction has 3872 states and 8827 transitions. [2019-11-15 20:46:48,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:46:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 8827 transitions. [2019-11-15 20:46:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 20:46:48,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:48,290 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] [2019-11-15 20:46:48,291 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:48,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash 480748516, now seen corresponding path program 1 times [2019-11-15 20:46:48,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:48,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073412696] [2019-11-15 20:46:48,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:48,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:48,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:48,394 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 20:46:48,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073412696] [2019-11-15 20:46:48,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:48,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:48,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367359069] [2019-11-15 20:46:48,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:48,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:48,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:48,399 INFO L87 Difference]: Start difference. First operand 3872 states and 8827 transitions. Second operand 5 states. [2019-11-15 20:46:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:48,658 INFO L93 Difference]: Finished difference Result 4823 states and 11022 transitions. [2019-11-15 20:46:48,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:46:48,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-15 20:46:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:48,663 INFO L225 Difference]: With dead ends: 4823 [2019-11-15 20:46:48,663 INFO L226 Difference]: Without dead ends: 4823 [2019-11-15 20:46:48,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:46:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2019-11-15 20:46:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4258. [2019-11-15 20:46:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4258 states. [2019-11-15 20:46:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4258 states to 4258 states and 9716 transitions. [2019-11-15 20:46:48,711 INFO L78 Accepts]: Start accepts. Automaton has 4258 states and 9716 transitions. Word has length 73 [2019-11-15 20:46:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:48,712 INFO L462 AbstractCegarLoop]: Abstraction has 4258 states and 9716 transitions. [2019-11-15 20:46:48,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:46:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4258 states and 9716 transitions. [2019-11-15 20:46:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 20:46:48,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:48,717 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] [2019-11-15 20:46:48,717 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2071408445, now seen corresponding path program 1 times [2019-11-15 20:46:48,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:48,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041478268] [2019-11-15 20:46:48,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:48,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:48,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:48,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041478268] [2019-11-15 20:46:48,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:48,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:46:48,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725651285] [2019-11-15 20:46:48,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:46:48,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:46:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:48,811 INFO L87 Difference]: Start difference. First operand 4258 states and 9716 transitions. Second operand 7 states. [2019-11-15 20:46:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:49,269 INFO L93 Difference]: Finished difference Result 4955 states and 11180 transitions. [2019-11-15 20:46:49,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:46:49,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-15 20:46:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:49,274 INFO L225 Difference]: With dead ends: 4955 [2019-11-15 20:46:49,274 INFO L226 Difference]: Without dead ends: 4902 [2019-11-15 20:46:49,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:46:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2019-11-15 20:46:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4316. [2019-11-15 20:46:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4316 states. [2019-11-15 20:46:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 9765 transitions. [2019-11-15 20:46:49,324 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 9765 transitions. Word has length 73 [2019-11-15 20:46:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:49,324 INFO L462 AbstractCegarLoop]: Abstraction has 4316 states and 9765 transitions. [2019-11-15 20:46:49,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:46:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 9765 transitions. [2019-11-15 20:46:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:46:49,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:49,328 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:49,329 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1201414691, now seen corresponding path program 1 times [2019-11-15 20:46:49,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:49,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852243540] [2019-11-15 20:46:49,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:49,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:49,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:49,385 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 20:46:49,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852243540] [2019-11-15 20:46:49,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:49,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:46:49,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390708650] [2019-11-15 20:46:49,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:46:49,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:46:49,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:46:49,388 INFO L87 Difference]: Start difference. First operand 4316 states and 9765 transitions. Second operand 3 states. [2019-11-15 20:46:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:49,576 INFO L93 Difference]: Finished difference Result 5922 states and 13049 transitions. [2019-11-15 20:46:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:46:49,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 20:46:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:49,583 INFO L225 Difference]: With dead ends: 5922 [2019-11-15 20:46:49,584 INFO L226 Difference]: Without dead ends: 5631 [2019-11-15 20:46:49,584 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 20:46:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-11-15 20:46:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5150. [2019-11-15 20:46:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5150 states. [2019-11-15 20:46:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 11491 transitions. [2019-11-15 20:46:49,658 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 11491 transitions. Word has length 94 [2019-11-15 20:46:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:49,658 INFO L462 AbstractCegarLoop]: Abstraction has 5150 states and 11491 transitions. [2019-11-15 20:46:49,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:46:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 11491 transitions. [2019-11-15 20:46:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:46:49,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:49,663 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:49,663 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1484565155, now seen corresponding path program 1 times [2019-11-15 20:46:49,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:49,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811521178] [2019-11-15 20:46:49,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:49,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:49,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:49,729 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 20:46:49,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811521178] [2019-11-15 20:46:49,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:49,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:49,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921482849] [2019-11-15 20:46:49,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:49,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:49,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:49,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:49,732 INFO L87 Difference]: Start difference. First operand 5150 states and 11491 transitions. Second operand 4 states. [2019-11-15 20:46:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:49,892 INFO L93 Difference]: Finished difference Result 5440 states and 12197 transitions. [2019-11-15 20:46:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:49,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 20:46:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:49,900 INFO L225 Difference]: With dead ends: 5440 [2019-11-15 20:46:49,900 INFO L226 Difference]: Without dead ends: 5440 [2019-11-15 20:46:49,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-11-15 20:46:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 4895. [2019-11-15 20:46:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2019-11-15 20:46:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 11028 transitions. [2019-11-15 20:46:49,967 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 11028 transitions. Word has length 94 [2019-11-15 20:46:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:49,967 INFO L462 AbstractCegarLoop]: Abstraction has 4895 states and 11028 transitions. [2019-11-15 20:46:49,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:49,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 11028 transitions. [2019-11-15 20:46:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 20:46:49,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:49,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:49,973 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2006724855, now seen corresponding path program 1 times [2019-11-15 20:46:49,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:49,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073899287] [2019-11-15 20:46:49,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:49,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:49,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:50,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073899287] [2019-11-15 20:46:50,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:50,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:50,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111970906] [2019-11-15 20:46:50,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:50,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:50,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:50,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:50,068 INFO L87 Difference]: Start difference. First operand 4895 states and 11028 transitions. Second operand 5 states. [2019-11-15 20:46:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:50,170 INFO L93 Difference]: Finished difference Result 5578 states and 12520 transitions. [2019-11-15 20:46:50,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:46:50,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-15 20:46:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:50,176 INFO L225 Difference]: With dead ends: 5578 [2019-11-15 20:46:50,176 INFO L226 Difference]: Without dead ends: 5578 [2019-11-15 20:46:50,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2019-11-15 20:46:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4288. [2019-11-15 20:46:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2019-11-15 20:46:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 9629 transitions. [2019-11-15 20:46:50,227 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 9629 transitions. Word has length 96 [2019-11-15 20:46:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:50,228 INFO L462 AbstractCegarLoop]: Abstraction has 4288 states and 9629 transitions. [2019-11-15 20:46:50,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:46:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 9629 transitions. [2019-11-15 20:46:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 20:46:50,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:50,232 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:50,232 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1995408728, now seen corresponding path program 1 times [2019-11-15 20:46:50,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:50,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978115895] [2019-11-15 20:46:50,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:50,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:50,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:50,304 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 20:46:50,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978115895] [2019-11-15 20:46:50,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:50,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:50,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747117182] [2019-11-15 20:46:50,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:50,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:50,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:50,307 INFO L87 Difference]: Start difference. First operand 4288 states and 9629 transitions. Second operand 4 states. [2019-11-15 20:46:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:50,642 INFO L93 Difference]: Finished difference Result 5028 states and 11235 transitions. [2019-11-15 20:46:50,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:46:50,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 20:46:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:50,649 INFO L225 Difference]: With dead ends: 5028 [2019-11-15 20:46:50,649 INFO L226 Difference]: Without dead ends: 4972 [2019-11-15 20:46:50,652 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 20:46:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2019-11-15 20:46:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 4761. [2019-11-15 20:46:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4761 states. [2019-11-15 20:46:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 10672 transitions. [2019-11-15 20:46:50,737 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 10672 transitions. Word has length 96 [2019-11-15 20:46:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:50,737 INFO L462 AbstractCegarLoop]: Abstraction has 4761 states and 10672 transitions. [2019-11-15 20:46:50,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 10672 transitions. [2019-11-15 20:46:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 20:46:50,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:50,745 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:50,745 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:50,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:50,746 INFO L82 PathProgramCache]: Analyzing trace with hash 222349225, now seen corresponding path program 1 times [2019-11-15 20:46:50,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:50,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368813606] [2019-11-15 20:46:50,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:50,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:50,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:51,068 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 20:46:51,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368813606] [2019-11-15 20:46:51,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:51,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:46:51,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851308071] [2019-11-15 20:46:51,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:46:51,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:51,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:46:51,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:46:51,070 INFO L87 Difference]: Start difference. First operand 4761 states and 10672 transitions. Second operand 10 states. [2019-11-15 20:46:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:52,280 INFO L93 Difference]: Finished difference Result 6970 states and 15324 transitions. [2019-11-15 20:46:52,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:46:52,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-11-15 20:46:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:52,287 INFO L225 Difference]: With dead ends: 6970 [2019-11-15 20:46:52,288 INFO L226 Difference]: Without dead ends: 6946 [2019-11-15 20:46:52,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:46:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-11-15 20:46:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5449. [2019-11-15 20:46:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2019-11-15 20:46:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 12050 transitions. [2019-11-15 20:46:52,354 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 12050 transitions. Word has length 96 [2019-11-15 20:46:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:52,355 INFO L462 AbstractCegarLoop]: Abstraction has 5449 states and 12050 transitions. [2019-11-15 20:46:52,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:46:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 12050 transitions. [2019-11-15 20:46:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 20:46:52,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:52,360 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:52,360 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1109852906, now seen corresponding path program 1 times [2019-11-15 20:46:52,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:52,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019609316] [2019-11-15 20:46:52,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:52,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:52,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:52,591 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 20:46:52,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019609316] [2019-11-15 20:46:52,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:52,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:46:52,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783673263] [2019-11-15 20:46:52,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:46:52,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:46:52,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:46:52,593 INFO L87 Difference]: Start difference. First operand 5449 states and 12050 transitions. Second operand 9 states. [2019-11-15 20:46:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:53,592 INFO L93 Difference]: Finished difference Result 6918 states and 15160 transitions. [2019-11-15 20:46:53,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:46:53,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-15 20:46:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:53,599 INFO L225 Difference]: With dead ends: 6918 [2019-11-15 20:46:53,600 INFO L226 Difference]: Without dead ends: 6918 [2019-11-15 20:46:53,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:46:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2019-11-15 20:46:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 5737. [2019-11-15 20:46:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5737 states. [2019-11-15 20:46:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 12643 transitions. [2019-11-15 20:46:53,668 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 12643 transitions. Word has length 96 [2019-11-15 20:46:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:53,668 INFO L462 AbstractCegarLoop]: Abstraction has 5737 states and 12643 transitions. [2019-11-15 20:46:53,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:46:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 12643 transitions. [2019-11-15 20:46:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 20:46:53,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:53,677 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:53,677 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash 433700138, now seen corresponding path program 1 times [2019-11-15 20:46:53,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:53,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107215127] [2019-11-15 20:46:53,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:53,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:53,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:53,931 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 20:46:53,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107215127] [2019-11-15 20:46:53,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:53,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:46:53,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444230555] [2019-11-15 20:46:53,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:46:53,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:53,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:46:53,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:46:53,934 INFO L87 Difference]: Start difference. First operand 5737 states and 12643 transitions. Second operand 9 states. [2019-11-15 20:46:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:54,524 INFO L93 Difference]: Finished difference Result 6089 states and 13371 transitions. [2019-11-15 20:46:54,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:46:54,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-15 20:46:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:54,531 INFO L225 Difference]: With dead ends: 6089 [2019-11-15 20:46:54,531 INFO L226 Difference]: Without dead ends: 6089 [2019-11-15 20:46:54,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:46:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2019-11-15 20:46:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 5604. [2019-11-15 20:46:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5604 states. [2019-11-15 20:46:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 12354 transitions. [2019-11-15 20:46:54,621 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 12354 transitions. Word has length 96 [2019-11-15 20:46:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:54,621 INFO L462 AbstractCegarLoop]: Abstraction has 5604 states and 12354 transitions. [2019-11-15 20:46:54,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:46:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 12354 transitions. [2019-11-15 20:46:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 20:46:54,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:54,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:54,629 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1321203819, now seen corresponding path program 1 times [2019-11-15 20:46:54,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:54,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202247456] [2019-11-15 20:46:54,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:54,886 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 20:46:54,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202247456] [2019-11-15 20:46:54,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:54,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:46:54,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595976710] [2019-11-15 20:46:54,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:46:54,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:54,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:46:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:46:54,889 INFO L87 Difference]: Start difference. First operand 5604 states and 12354 transitions. Second operand 10 states. [2019-11-15 20:46:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:55,649 INFO L93 Difference]: Finished difference Result 21862 states and 48629 transitions. [2019-11-15 20:46:55,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 20:46:55,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-11-15 20:46:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:55,668 INFO L225 Difference]: With dead ends: 21862 [2019-11-15 20:46:55,668 INFO L226 Difference]: Without dead ends: 12729 [2019-11-15 20:46:55,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:46:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12729 states. [2019-11-15 20:46:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12729 to 5320. [2019-11-15 20:46:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-11-15 20:46:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 11635 transitions. [2019-11-15 20:46:55,925 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 11635 transitions. Word has length 96 [2019-11-15 20:46:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:55,926 INFO L462 AbstractCegarLoop]: Abstraction has 5320 states and 11635 transitions. [2019-11-15 20:46:55,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:46:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 11635 transitions. [2019-11-15 20:46:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 20:46:55,933 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:55,933 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:55,934 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash 500491279, now seen corresponding path program 2 times [2019-11-15 20:46:55,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:55,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948226170] [2019-11-15 20:46:55,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:55,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:55,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:56,068 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:56,069 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:46:56,277 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:46:56,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:46:56 BasicIcfg [2019-11-15 20:46:56,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:46:56,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:46:56,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:46:56,284 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:46:56,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:46:07" (3/4) ... [2019-11-15 20:46:56,296 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:46:56,450 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5373bae2-6d8c-4c07-9946-b1b725ae8c7b/bin/uautomizer/witness.graphml [2019-11-15 20:46:56,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:46:56,452 INFO L168 Benchmark]: Toolchain (without parser) took 50980.94 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 944.8 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 811.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:56,453 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:56,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:56,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:56,454 INFO L168 Benchmark]: Boogie Preprocessor took 95.97 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 20:46:56,455 INFO L168 Benchmark]: RCFGBuilder took 930.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:56,455 INFO L168 Benchmark]: TraceAbstraction took 48895.34 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 706.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:56,456 INFO L168 Benchmark]: Witness Printer took 166.46 ms. Allocated memory is still 4.7 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:56,458 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 819.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.97 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 930.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48895.34 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 706.7 MB. Max. memory is 11.5 GB. * Witness Printer took 166.46 ms. Allocated memory is still 4.7 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L801] 0 pthread_t t1601; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L802] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L803] 0 pthread_t t1602; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L731] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L732] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L733] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L734] 1 x$r_buff0_thd1 = (_Bool)1 [L737] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, z=0] [L804] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=2, z=1] [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L772] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] 2 x = x$flush_delayed ? x$mem_tmp : x [L776] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] 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) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L781] 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 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 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) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] 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 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L814] 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 [L817] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 3 error locations. Result: UNSAFE, OverallTime: 48.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8819 SDtfs, 9222 SDslu, 20629 SDs, 0 SdLazy, 7782 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 86 SyntacticMatches, 21 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 78988 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2180 NumberOfCodeBlocks, 2180 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2054 ConstructedInterpolants, 0 QuantifiedInterpolants, 411947 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...