./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_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_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/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 bf2cd00fabce720f4c3f98371101c93927116a53 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:52:40,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:52:40,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:52:40,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:52:40,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:52:40,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:52:40,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:52:40,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:52:40,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:52:40,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:52:40,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:52:40,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:52:40,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:52:40,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:52:40,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:52:40,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:52:40,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:52:40,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:52:40,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:52:40,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:52:40,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:52:40,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:52:40,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:52:40,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:52:40,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:52:40,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:52:40,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:52:40,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:52:40,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:52:40,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:52:40,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:52:40,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:52:40,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:52:40,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:52:40,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:52:40,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:52:40,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:52:40,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:52:40,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:52:40,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:52:40,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:52:40,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:52:40,617 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:52:40,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:52:40,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:52:40,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:52:40,619 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:52:40,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:52:40,620 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:52:40,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:52:40,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:52:40,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:52:40,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:52:40,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:52:40,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:52:40,626 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:52:40,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:52:40,626 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:52:40,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:52:40,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:52:40,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:52:40,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:52:40,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:52:40,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:40,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:52:40,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:52:40,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:52:40,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:52:40,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:52:40,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:52:40,629 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_2a7db04a-8530-4947-80f6-ac7f1938cc2a/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 -> bf2cd00fabce720f4c3f98371101c93927116a53 [2019-11-15 23:52:40,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:52:40,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:52:40,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:52:40,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:52:40,692 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:52:40,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i [2019-11-15 23:52:40,747 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/data/6ef07e45f/d9c326bfe76044fea21ebacd57793354/FLAG1f9d4da49 [2019-11-15 23:52:41,232 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:52:41,233 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i [2019-11-15 23:52:41,250 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/data/6ef07e45f/d9c326bfe76044fea21ebacd57793354/FLAG1f9d4da49 [2019-11-15 23:52:41,712 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/data/6ef07e45f/d9c326bfe76044fea21ebacd57793354 [2019-11-15 23:52:41,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:52:41,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:52:41,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:41,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:52:41,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:52:41,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:41" (1/1) ... [2019-11-15 23:52:41,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e676c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:41, skipping insertion in model container [2019-11-15 23:52:41,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:41" (1/1) ... [2019-11-15 23:52:41,735 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:52:41,778 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:52:42,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:42,217 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:52:42,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:42,342 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:52:42,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42 WrapperNode [2019-11-15 23:52:42,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:42,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:42,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:52:42,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:52:42,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:42,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:52:42,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:52:42,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:52:42,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... [2019-11-15 23:52:42,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:52:42,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:52:42,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:52:42,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:52:42,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:52:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:52:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:52:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:52:42,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:52:42,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:52:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:52:42,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:52:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:52:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:52:42,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:52:42,528 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:52:43,233 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:52:43,233 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:52:43,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:43 BoogieIcfgContainer [2019-11-15 23:52:43,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:52:43,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:52:43,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:52:43,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:52:43,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:52:41" (1/3) ... [2019-11-15 23:52:43,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea704f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:43, skipping insertion in model container [2019-11-15 23:52:43,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:42" (2/3) ... [2019-11-15 23:52:43,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea704f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:43, skipping insertion in model container [2019-11-15 23:52:43,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:43" (3/3) ... [2019-11-15 23:52:43,245 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-11-15 23:52:43,305 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,305 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,306 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,306 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,306 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,306 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,307 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,307 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,307 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,308 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,308 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,308 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,308 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,308 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,309 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,309 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,309 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,309 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,310 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,310 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,310 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,310 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,312 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,312 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,312 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,312 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,313 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,313 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,313 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,315 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,316 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,333 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,333 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,333 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,333 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,333 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,334 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,334 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,334 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,334 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,335 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,335 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,335 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,335 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,335 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,336 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,336 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,336 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,336 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,337 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,337 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,337 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,337 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,337 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,338 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,338 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,338 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,338 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,339 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,339 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,339 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,339 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,339 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,340 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,340 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,340 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,340 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,340 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,341 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:52:43,346 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:52:43,347 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:52:43,355 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:52:43,367 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:52:43,387 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:52:43,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:52:43,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:52:43,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:52:43,388 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:52:43,388 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:52:43,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:52:43,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:52:43,411 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 177 transitions [2019-11-15 23:52:46,231 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32589 states. [2019-11-15 23:52:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 32589 states. [2019-11-15 23:52:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:52:46,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:46,241 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:46,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:46,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash 737563216, now seen corresponding path program 1 times [2019-11-15 23:52:46,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:46,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363753323] [2019-11-15 23:52:46,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:46,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:46,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:46,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363753323] [2019-11-15 23:52:46,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:46,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:52:46,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294495499] [2019-11-15 23:52:46,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:46,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:46,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:46,582 INFO L87 Difference]: Start difference. First operand 32589 states. Second operand 4 states. [2019-11-15 23:52:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:47,461 INFO L93 Difference]: Finished difference Result 33589 states and 129566 transitions. [2019-11-15 23:52:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:47,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 23:52:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:47,741 INFO L225 Difference]: With dead ends: 33589 [2019-11-15 23:52:47,741 INFO L226 Difference]: Without dead ends: 25701 [2019-11-15 23:52:47,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25701 states. [2019-11-15 23:52:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25701 to 25701. [2019-11-15 23:52:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25701 states. [2019-11-15 23:52:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25701 states to 25701 states and 99582 transitions. [2019-11-15 23:52:49,340 INFO L78 Accepts]: Start accepts. Automaton has 25701 states and 99582 transitions. Word has length 32 [2019-11-15 23:52:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:49,341 INFO L462 AbstractCegarLoop]: Abstraction has 25701 states and 99582 transitions. [2019-11-15 23:52:49,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 25701 states and 99582 transitions. [2019-11-15 23:52:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:52:49,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:49,357 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:49,357 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:49,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1112209964, now seen corresponding path program 1 times [2019-11-15 23:52:49,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:49,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525377078] [2019-11-15 23:52:49,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:49,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:49,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:49,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525377078] [2019-11-15 23:52:49,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:49,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:52:49,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105606687] [2019-11-15 23:52:49,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:52:49,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:49,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:52:49,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:49,497 INFO L87 Difference]: Start difference. First operand 25701 states and 99582 transitions. Second operand 5 states. [2019-11-15 23:52:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:50,562 INFO L93 Difference]: Finished difference Result 41079 states and 150429 transitions. [2019-11-15 23:52:50,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:52:50,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 23:52:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:50,752 INFO L225 Difference]: With dead ends: 41079 [2019-11-15 23:52:50,752 INFO L226 Difference]: Without dead ends: 40543 [2019-11-15 23:52:50,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40543 states. [2019-11-15 23:52:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40543 to 38923. [2019-11-15 23:52:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38923 states. [2019-11-15 23:52:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38923 states to 38923 states and 143579 transitions. [2019-11-15 23:52:52,451 INFO L78 Accepts]: Start accepts. Automaton has 38923 states and 143579 transitions. Word has length 44 [2019-11-15 23:52:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:52,454 INFO L462 AbstractCegarLoop]: Abstraction has 38923 states and 143579 transitions. [2019-11-15 23:52:52,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:52:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 38923 states and 143579 transitions. [2019-11-15 23:52:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:52:52,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:52,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:52,462 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:52,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash -64291244, now seen corresponding path program 1 times [2019-11-15 23:52:52,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:52,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971621727] [2019-11-15 23:52:52,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:52,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:52,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:52,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971621727] [2019-11-15 23:52:52,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:52,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:52:52,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176958875] [2019-11-15 23:52:52,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:52:52,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:52:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:52,536 INFO L87 Difference]: Start difference. First operand 38923 states and 143579 transitions. Second operand 5 states. [2019-11-15 23:52:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:53,135 INFO L93 Difference]: Finished difference Result 49776 states and 180631 transitions. [2019-11-15 23:52:53,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:52:53,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 23:52:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:53,290 INFO L225 Difference]: With dead ends: 49776 [2019-11-15 23:52:53,290 INFO L226 Difference]: Without dead ends: 49272 [2019-11-15 23:52:53,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49272 states. [2019-11-15 23:52:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49272 to 42675. [2019-11-15 23:52:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42675 states. [2019-11-15 23:52:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42675 states to 42675 states and 156590 transitions. [2019-11-15 23:52:55,029 INFO L78 Accepts]: Start accepts. Automaton has 42675 states and 156590 transitions. Word has length 45 [2019-11-15 23:52:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:55,029 INFO L462 AbstractCegarLoop]: Abstraction has 42675 states and 156590 transitions. [2019-11-15 23:52:55,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:52:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 42675 states and 156590 transitions. [2019-11-15 23:52:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:52:55,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:55,039 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:55,040 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:55,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:55,040 INFO L82 PathProgramCache]: Analyzing trace with hash -683113030, now seen corresponding path program 1 times [2019-11-15 23:52:55,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:55,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897799659] [2019-11-15 23:52:55,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:55,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897799659] [2019-11-15 23:52:55,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:55,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:55,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963211123] [2019-11-15 23:52:55,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:55,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:55,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:55,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:55,084 INFO L87 Difference]: Start difference. First operand 42675 states and 156590 transitions. Second operand 3 states. [2019-11-15 23:52:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:55,368 INFO L93 Difference]: Finished difference Result 61085 states and 221428 transitions. [2019-11-15 23:52:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:55,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-15 23:52:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:55,559 INFO L225 Difference]: With dead ends: 61085 [2019-11-15 23:52:55,560 INFO L226 Difference]: Without dead ends: 61085 [2019-11-15 23:52:55,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61085 states. [2019-11-15 23:52:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61085 to 48014. [2019-11-15 23:52:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48014 states. [2019-11-15 23:52:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48014 states to 48014 states and 174177 transitions. [2019-11-15 23:52:57,520 INFO L78 Accepts]: Start accepts. Automaton has 48014 states and 174177 transitions. Word has length 47 [2019-11-15 23:52:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:57,520 INFO L462 AbstractCegarLoop]: Abstraction has 48014 states and 174177 transitions. [2019-11-15 23:52:57,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 48014 states and 174177 transitions. [2019-11-15 23:52:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:52:57,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:57,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:57,538 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1641831505, now seen corresponding path program 1 times [2019-11-15 23:52:57,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:57,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113484190] [2019-11-15 23:52:57,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:57,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:57,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:57,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113484190] [2019-11-15 23:52:57,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:57,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:52:57,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733426479] [2019-11-15 23:52:57,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:52:57,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:52:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:57,733 INFO L87 Difference]: Start difference. First operand 48014 states and 174177 transitions. Second operand 6 states. [2019-11-15 23:52:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:58,683 INFO L93 Difference]: Finished difference Result 63754 states and 229377 transitions. [2019-11-15 23:52:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:52:58,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 23:52:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:02,083 INFO L225 Difference]: With dead ends: 63754 [2019-11-15 23:53:02,083 INFO L226 Difference]: Without dead ends: 63754 [2019-11-15 23:53:02,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:53:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63754 states. [2019-11-15 23:53:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63754 to 59947. [2019-11-15 23:53:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59947 states. [2019-11-15 23:53:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59947 states to 59947 states and 215670 transitions. [2019-11-15 23:53:03,193 INFO L78 Accepts]: Start accepts. Automaton has 59947 states and 215670 transitions. Word has length 51 [2019-11-15 23:53:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:03,194 INFO L462 AbstractCegarLoop]: Abstraction has 59947 states and 215670 transitions. [2019-11-15 23:53:03,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:53:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 59947 states and 215670 transitions. [2019-11-15 23:53:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:53:03,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:03,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:03,214 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:03,214 INFO L82 PathProgramCache]: Analyzing trace with hash 856184432, now seen corresponding path program 1 times [2019-11-15 23:53:03,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:03,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550684197] [2019-11-15 23:53:03,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:03,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:03,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:03,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550684197] [2019-11-15 23:53:03,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:03,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:53:03,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654937105] [2019-11-15 23:53:03,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:53:03,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:03,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:53:03,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:03,324 INFO L87 Difference]: Start difference. First operand 59947 states and 215670 transitions. Second operand 7 states. [2019-11-15 23:53:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:04,588 INFO L93 Difference]: Finished difference Result 83683 states and 290095 transitions. [2019-11-15 23:53:04,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:53:04,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-15 23:53:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:04,774 INFO L225 Difference]: With dead ends: 83683 [2019-11-15 23:53:04,774 INFO L226 Difference]: Without dead ends: 83683 [2019-11-15 23:53:04,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:53:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83683 states. [2019-11-15 23:53:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83683 to 71010. [2019-11-15 23:53:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71010 states. [2019-11-15 23:53:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71010 states to 71010 states and 249884 transitions. [2019-11-15 23:53:06,713 INFO L78 Accepts]: Start accepts. Automaton has 71010 states and 249884 transitions. Word has length 51 [2019-11-15 23:53:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:06,713 INFO L462 AbstractCegarLoop]: Abstraction has 71010 states and 249884 transitions. [2019-11-15 23:53:06,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:53:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 71010 states and 249884 transitions. [2019-11-15 23:53:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:53:06,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:06,727 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:06,728 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:06,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1743688113, now seen corresponding path program 1 times [2019-11-15 23:53:06,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:06,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683263848] [2019-11-15 23:53:06,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:06,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:06,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:06,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683263848] [2019-11-15 23:53:06,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:06,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:06,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527730225] [2019-11-15 23:53:06,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:06,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:06,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:06,800 INFO L87 Difference]: Start difference. First operand 71010 states and 249884 transitions. Second operand 4 states. [2019-11-15 23:53:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:06,874 INFO L93 Difference]: Finished difference Result 12157 states and 37827 transitions. [2019-11-15 23:53:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:53:06,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 23:53:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:06,896 INFO L225 Difference]: With dead ends: 12157 [2019-11-15 23:53:06,897 INFO L226 Difference]: Without dead ends: 10672 [2019-11-15 23:53:06,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10672 states. [2019-11-15 23:53:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10672 to 10623. [2019-11-15 23:53:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10623 states. [2019-11-15 23:53:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10623 states to 10623 states and 32589 transitions. [2019-11-15 23:53:07,047 INFO L78 Accepts]: Start accepts. Automaton has 10623 states and 32589 transitions. Word has length 51 [2019-11-15 23:53:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:07,047 INFO L462 AbstractCegarLoop]: Abstraction has 10623 states and 32589 transitions. [2019-11-15 23:53:07,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 10623 states and 32589 transitions. [2019-11-15 23:53:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:53:07,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:07,050 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:07,050 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1023975291, now seen corresponding path program 1 times [2019-11-15 23:53:07,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:07,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159435053] [2019-11-15 23:53:07,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:07,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:07,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:07,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159435053] [2019-11-15 23:53:07,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:07,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:53:07,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19629075] [2019-11-15 23:53:07,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:53:07,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:07,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:53:07,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:07,118 INFO L87 Difference]: Start difference. First operand 10623 states and 32589 transitions. Second operand 6 states. [2019-11-15 23:53:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:07,500 INFO L93 Difference]: Finished difference Result 13180 states and 39870 transitions. [2019-11-15 23:53:07,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:53:07,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 23:53:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:07,528 INFO L225 Difference]: With dead ends: 13180 [2019-11-15 23:53:07,528 INFO L226 Difference]: Without dead ends: 13117 [2019-11-15 23:53:07,528 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 23:53:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13117 states. [2019-11-15 23:53:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13117 to 11046. [2019-11-15 23:53:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11046 states. [2019-11-15 23:53:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11046 states to 11046 states and 33783 transitions. [2019-11-15 23:53:07,726 INFO L78 Accepts]: Start accepts. Automaton has 11046 states and 33783 transitions. Word has length 51 [2019-11-15 23:53:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:07,727 INFO L462 AbstractCegarLoop]: Abstraction has 11046 states and 33783 transitions. [2019-11-15 23:53:07,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:53:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 11046 states and 33783 transitions. [2019-11-15 23:53:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:53:07,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:07,730 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:07,731 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:07,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash -126708958, now seen corresponding path program 1 times [2019-11-15 23:53:07,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:07,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121742754] [2019-11-15 23:53:07,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:07,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:07,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:07,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121742754] [2019-11-15 23:53:07,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:07,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:07,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703572996] [2019-11-15 23:53:07,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:07,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:07,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:07,803 INFO L87 Difference]: Start difference. First operand 11046 states and 33783 transitions. Second operand 4 states. [2019-11-15 23:53:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:07,933 INFO L93 Difference]: Finished difference Result 12860 states and 39389 transitions. [2019-11-15 23:53:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:53:07,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 23:53:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:07,953 INFO L225 Difference]: With dead ends: 12860 [2019-11-15 23:53:07,953 INFO L226 Difference]: Without dead ends: 12860 [2019-11-15 23:53:07,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12860 states. [2019-11-15 23:53:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12860 to 11691. [2019-11-15 23:53:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11691 states. [2019-11-15 23:53:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11691 states to 11691 states and 35760 transitions. [2019-11-15 23:53:08,259 INFO L78 Accepts]: Start accepts. Automaton has 11691 states and 35760 transitions. Word has length 59 [2019-11-15 23:53:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:08,260 INFO L462 AbstractCegarLoop]: Abstraction has 11691 states and 35760 transitions. [2019-11-15 23:53:08,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11691 states and 35760 transitions. [2019-11-15 23:53:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:53:08,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:08,265 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:08,265 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1616101377, now seen corresponding path program 1 times [2019-11-15 23:53:08,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:08,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760085546] [2019-11-15 23:53:08,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:08,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:08,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:08,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760085546] [2019-11-15 23:53:08,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:08,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:53:08,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635439215] [2019-11-15 23:53:08,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:53:08,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:53:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:08,348 INFO L87 Difference]: Start difference. First operand 11691 states and 35760 transitions. Second operand 6 states. [2019-11-15 23:53:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:08,812 INFO L93 Difference]: Finished difference Result 14217 states and 42858 transitions. [2019-11-15 23:53:08,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:53:08,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-15 23:53:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:08,833 INFO L225 Difference]: With dead ends: 14217 [2019-11-15 23:53:08,833 INFO L226 Difference]: Without dead ends: 14156 [2019-11-15 23:53:08,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:53:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-11-15 23:53:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 13459. [2019-11-15 23:53:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13459 states. [2019-11-15 23:53:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 40777 transitions. [2019-11-15 23:53:09,021 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 40777 transitions. Word has length 59 [2019-11-15 23:53:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:09,022 INFO L462 AbstractCegarLoop]: Abstraction has 13459 states and 40777 transitions. [2019-11-15 23:53:09,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:53:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 40777 transitions. [2019-11-15 23:53:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:53:09,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:09,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:09,028 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1913952989, now seen corresponding path program 1 times [2019-11-15 23:53:09,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:09,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741525885] [2019-11-15 23:53:09,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:09,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:09,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741525885] [2019-11-15 23:53:09,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:09,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:09,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487477794] [2019-11-15 23:53:09,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:09,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:09,093 INFO L87 Difference]: Start difference. First operand 13459 states and 40777 transitions. Second operand 4 states. [2019-11-15 23:53:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:09,401 INFO L93 Difference]: Finished difference Result 16501 states and 49369 transitions. [2019-11-15 23:53:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:09,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 23:53:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:09,432 INFO L225 Difference]: With dead ends: 16501 [2019-11-15 23:53:09,432 INFO L226 Difference]: Without dead ends: 16501 [2019-11-15 23:53:09,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16501 states. [2019-11-15 23:53:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16501 to 14980. [2019-11-15 23:53:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14980 states. [2019-11-15 23:53:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14980 states to 14980 states and 44958 transitions. [2019-11-15 23:53:09,658 INFO L78 Accepts]: Start accepts. Automaton has 14980 states and 44958 transitions. Word has length 63 [2019-11-15 23:53:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:09,659 INFO L462 AbstractCegarLoop]: Abstraction has 14980 states and 44958 transitions. [2019-11-15 23:53:09,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 14980 states and 44958 transitions. [2019-11-15 23:53:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:53:09,666 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:09,667 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:09,667 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:09,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:09,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1659216444, now seen corresponding path program 1 times [2019-11-15 23:53:09,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:09,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856266771] [2019-11-15 23:53:09,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:09,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:09,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:09,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856266771] [2019-11-15 23:53:09,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:09,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:09,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582729693] [2019-11-15 23:53:09,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:09,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:09,723 INFO L87 Difference]: Start difference. First operand 14980 states and 44958 transitions. Second operand 3 states. [2019-11-15 23:53:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:09,996 INFO L93 Difference]: Finished difference Result 15528 states and 46401 transitions. [2019-11-15 23:53:09,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:09,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 23:53:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:10,018 INFO L225 Difference]: With dead ends: 15528 [2019-11-15 23:53:10,018 INFO L226 Difference]: Without dead ends: 15528 [2019-11-15 23:53:10,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2019-11-15 23:53:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 15274. [2019-11-15 23:53:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15274 states. [2019-11-15 23:53:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15274 states to 15274 states and 45726 transitions. [2019-11-15 23:53:10,219 INFO L78 Accepts]: Start accepts. Automaton has 15274 states and 45726 transitions. Word has length 63 [2019-11-15 23:53:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:10,220 INFO L462 AbstractCegarLoop]: Abstraction has 15274 states and 45726 transitions. [2019-11-15 23:53:10,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 15274 states and 45726 transitions. [2019-11-15 23:53:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:53:10,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:10,229 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 23:53:10,229 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:10,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash -939220032, now seen corresponding path program 1 times [2019-11-15 23:53:10,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:10,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952624280] [2019-11-15 23:53:10,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:10,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:10,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:10,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952624280] [2019-11-15 23:53:10,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:10,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:53:10,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275243619] [2019-11-15 23:53:10,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:53:10,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:10,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:53:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:10,352 INFO L87 Difference]: Start difference. First operand 15274 states and 45726 transitions. Second operand 6 states. [2019-11-15 23:53:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:10,801 INFO L93 Difference]: Finished difference Result 16271 states and 48101 transitions. [2019-11-15 23:53:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:53:10,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 23:53:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:10,824 INFO L225 Difference]: With dead ends: 16271 [2019-11-15 23:53:10,824 INFO L226 Difference]: Without dead ends: 16271 [2019-11-15 23:53:10,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:53:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16271 states. [2019-11-15 23:53:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16271 to 15847. [2019-11-15 23:53:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15847 states. [2019-11-15 23:53:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15847 states to 15847 states and 47023 transitions. [2019-11-15 23:53:11,031 INFO L78 Accepts]: Start accepts. Automaton has 15847 states and 47023 transitions. Word has length 65 [2019-11-15 23:53:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:11,031 INFO L462 AbstractCegarLoop]: Abstraction has 15847 states and 47023 transitions. [2019-11-15 23:53:11,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:53:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15847 states and 47023 transitions. [2019-11-15 23:53:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:53:11,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:11,042 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 23:53:11,042 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1193956577, now seen corresponding path program 1 times [2019-11-15 23:53:11,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:11,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178101604] [2019-11-15 23:53:11,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:11,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:11,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:11,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178101604] [2019-11-15 23:53:11,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:11,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:53:11,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138478999] [2019-11-15 23:53:11,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:53:11,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:11,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:53:11,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:11,142 INFO L87 Difference]: Start difference. First operand 15847 states and 47023 transitions. Second operand 6 states. [2019-11-15 23:53:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:11,701 INFO L93 Difference]: Finished difference Result 18158 states and 52351 transitions. [2019-11-15 23:53:11,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:53:11,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 23:53:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:11,729 INFO L225 Difference]: With dead ends: 18158 [2019-11-15 23:53:11,730 INFO L226 Difference]: Without dead ends: 18158 [2019-11-15 23:53:11,730 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 23:53:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18158 states. [2019-11-15 23:53:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18158 to 16539. [2019-11-15 23:53:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16539 states. [2019-11-15 23:53:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16539 states to 16539 states and 48243 transitions. [2019-11-15 23:53:11,958 INFO L78 Accepts]: Start accepts. Automaton has 16539 states and 48243 transitions. Word has length 65 [2019-11-15 23:53:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:11,958 INFO L462 AbstractCegarLoop]: Abstraction has 16539 states and 48243 transitions. [2019-11-15 23:53:11,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:53:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 16539 states and 48243 transitions. [2019-11-15 23:53:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:53:11,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:11,970 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 23:53:11,970 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:11,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:11,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1260963330, now seen corresponding path program 1 times [2019-11-15 23:53:11,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:11,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488647191] [2019-11-15 23:53:11,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:11,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:11,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:12,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 23:53:12,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488647191] [2019-11-15 23:53:12,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:12,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:53:12,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838724886] [2019-11-15 23:53:12,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:53:12,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:12,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:53:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:12,066 INFO L87 Difference]: Start difference. First operand 16539 states and 48243 transitions. Second operand 5 states. [2019-11-15 23:53:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:12,378 INFO L93 Difference]: Finished difference Result 21453 states and 62483 transitions. [2019-11-15 23:53:12,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:53:12,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 23:53:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:12,408 INFO L225 Difference]: With dead ends: 21453 [2019-11-15 23:53:12,408 INFO L226 Difference]: Without dead ends: 21453 [2019-11-15 23:53:12,408 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 23:53:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21453 states. [2019-11-15 23:53:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21453 to 19518. [2019-11-15 23:53:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19518 states. [2019-11-15 23:53:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 56652 transitions. [2019-11-15 23:53:12,699 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 56652 transitions. Word has length 65 [2019-11-15 23:53:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:12,699 INFO L462 AbstractCegarLoop]: Abstraction has 19518 states and 56652 transitions. [2019-11-15 23:53:12,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:53:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 56652 transitions. [2019-11-15 23:53:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:53:12,713 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:12,713 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 23:53:12,714 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1771497507, now seen corresponding path program 1 times [2019-11-15 23:53:12,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:12,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672083655] [2019-11-15 23:53:12,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:12,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:12,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:12,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672083655] [2019-11-15 23:53:12,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:12,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:53:12,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239748834] [2019-11-15 23:53:12,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:53:12,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:12,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:53:12,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:12,794 INFO L87 Difference]: Start difference. First operand 19518 states and 56652 transitions. Second operand 5 states. [2019-11-15 23:53:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:13,289 INFO L93 Difference]: Finished difference Result 26405 states and 76310 transitions. [2019-11-15 23:53:13,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:53:13,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 23:53:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:13,329 INFO L225 Difference]: With dead ends: 26405 [2019-11-15 23:53:13,329 INFO L226 Difference]: Without dead ends: 26405 [2019-11-15 23:53:13,329 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 23:53:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26405 states. [2019-11-15 23:53:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26405 to 21406. [2019-11-15 23:53:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21406 states. [2019-11-15 23:53:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21406 states to 21406 states and 61926 transitions. [2019-11-15 23:53:13,756 INFO L78 Accepts]: Start accepts. Automaton has 21406 states and 61926 transitions. Word has length 65 [2019-11-15 23:53:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:13,756 INFO L462 AbstractCegarLoop]: Abstraction has 21406 states and 61926 transitions. [2019-11-15 23:53:13,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:53:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 21406 states and 61926 transitions. [2019-11-15 23:53:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:53:13,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:13,767 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:13,767 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash 716015326, now seen corresponding path program 1 times [2019-11-15 23:53:13,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:13,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901771361] [2019-11-15 23:53:13,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:13,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:13,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:13,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901771361] [2019-11-15 23:53:13,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:13,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:13,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772583778] [2019-11-15 23:53:13,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:13,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:13,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:13,849 INFO L87 Difference]: Start difference. First operand 21406 states and 61926 transitions. Second operand 4 states. [2019-11-15 23:53:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:14,600 INFO L93 Difference]: Finished difference Result 27967 states and 81348 transitions. [2019-11-15 23:53:14,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:53:14,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 23:53:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:14,655 INFO L225 Difference]: With dead ends: 27967 [2019-11-15 23:53:14,655 INFO L226 Difference]: Without dead ends: 27832 [2019-11-15 23:53:14,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27832 states. [2019-11-15 23:53:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27832 to 25843. [2019-11-15 23:53:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25843 states. [2019-11-15 23:53:15,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25843 states to 25843 states and 75186 transitions. [2019-11-15 23:53:15,072 INFO L78 Accepts]: Start accepts. Automaton has 25843 states and 75186 transitions. Word has length 65 [2019-11-15 23:53:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:15,072 INFO L462 AbstractCegarLoop]: Abstraction has 25843 states and 75186 transitions. [2019-11-15 23:53:15,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 25843 states and 75186 transitions. [2019-11-15 23:53:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:53:15,081 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:15,081 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 23:53:15,082 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:15,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1080936033, now seen corresponding path program 1 times [2019-11-15 23:53:15,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:15,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85748139] [2019-11-15 23:53:15,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:15,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:15,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:15,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85748139] [2019-11-15 23:53:15,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:15,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:53:15,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664378847] [2019-11-15 23:53:15,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:53:15,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:53:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:15,227 INFO L87 Difference]: Start difference. First operand 25843 states and 75186 transitions. Second operand 7 states. [2019-11-15 23:53:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:15,679 INFO L93 Difference]: Finished difference Result 23111 states and 64208 transitions. [2019-11-15 23:53:15,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:53:15,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-15 23:53:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:15,709 INFO L225 Difference]: With dead ends: 23111 [2019-11-15 23:53:15,709 INFO L226 Difference]: Without dead ends: 23111 [2019-11-15 23:53:15,709 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 23:53:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23111 states. [2019-11-15 23:53:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23111 to 18807. [2019-11-15 23:53:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-11-15 23:53:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 52243 transitions. [2019-11-15 23:53:15,974 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 52243 transitions. Word has length 65 [2019-11-15 23:53:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:15,974 INFO L462 AbstractCegarLoop]: Abstraction has 18807 states and 52243 transitions. [2019-11-15 23:53:15,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:53:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 52243 transitions. [2019-11-15 23:53:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:53:15,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:15,981 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 23:53:15,981 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash -193432352, now seen corresponding path program 1 times [2019-11-15 23:53:15,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:15,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988296716] [2019-11-15 23:53:15,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:15,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:15,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:16,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988296716] [2019-11-15 23:53:16,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:16,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:53:16,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104677962] [2019-11-15 23:53:16,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:53:16,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:16,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:53:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:16,062 INFO L87 Difference]: Start difference. First operand 18807 states and 52243 transitions. Second operand 5 states. [2019-11-15 23:53:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:16,114 INFO L93 Difference]: Finished difference Result 6129 states and 14460 transitions. [2019-11-15 23:53:16,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:53:16,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 23:53:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:16,119 INFO L225 Difference]: With dead ends: 6129 [2019-11-15 23:53:16,119 INFO L226 Difference]: Without dead ends: 5259 [2019-11-15 23:53:16,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-11-15 23:53:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4724. [2019-11-15 23:53:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-11-15 23:53:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 10819 transitions. [2019-11-15 23:53:16,168 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 10819 transitions. Word has length 65 [2019-11-15 23:53:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:16,168 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 10819 transitions. [2019-11-15 23:53:16,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:53:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 10819 transitions. [2019-11-15 23:53:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:53:16,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:16,172 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 23:53:16,172 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:16,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2083784590, now seen corresponding path program 1 times [2019-11-15 23:53:16,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:16,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209545179] [2019-11-15 23:53:16,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:16,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:16,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:16,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209545179] [2019-11-15 23:53:16,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:16,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:16,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207773893] [2019-11-15 23:53:16,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:16,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:16,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:16,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:16,220 INFO L87 Difference]: Start difference. First operand 4724 states and 10819 transitions. Second operand 3 states. [2019-11-15 23:53:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:16,261 INFO L93 Difference]: Finished difference Result 5854 states and 13185 transitions. [2019-11-15 23:53:16,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:16,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-15 23:53:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:16,269 INFO L225 Difference]: With dead ends: 5854 [2019-11-15 23:53:16,269 INFO L226 Difference]: Without dead ends: 5854 [2019-11-15 23:53:16,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-11-15 23:53:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 4659. [2019-11-15 23:53:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-11-15 23:53:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 10381 transitions. [2019-11-15 23:53:16,339 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 10381 transitions. Word has length 65 [2019-11-15 23:53:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:16,339 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 10381 transitions. [2019-11-15 23:53:16,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 10381 transitions. [2019-11-15 23:53:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:53:16,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:16,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:16,345 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1306291909, now seen corresponding path program 1 times [2019-11-15 23:53:16,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:16,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862119769] [2019-11-15 23:53:16,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:16,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:16,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:16,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862119769] [2019-11-15 23:53:16,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:16,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:53:16,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181151912] [2019-11-15 23:53:16,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:53:16,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:53:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:16,436 INFO L87 Difference]: Start difference. First operand 4659 states and 10381 transitions. Second operand 5 states. [2019-11-15 23:53:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:16,646 INFO L93 Difference]: Finished difference Result 5720 states and 12810 transitions. [2019-11-15 23:53:16,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:53:16,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-15 23:53:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:16,653 INFO L225 Difference]: With dead ends: 5720 [2019-11-15 23:53:16,653 INFO L226 Difference]: Without dead ends: 5720 [2019-11-15 23:53:16,655 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 23:53:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2019-11-15 23:53:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5079. [2019-11-15 23:53:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2019-11-15 23:53:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11339 transitions. [2019-11-15 23:53:16,726 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11339 transitions. Word has length 71 [2019-11-15 23:53:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:16,727 INFO L462 AbstractCegarLoop]: Abstraction has 5079 states and 11339 transitions. [2019-11-15 23:53:16,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:53:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11339 transitions. [2019-11-15 23:53:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:53:16,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:16,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:16,734 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1245865052, now seen corresponding path program 1 times [2019-11-15 23:53:16,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:16,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118858776] [2019-11-15 23:53:16,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:16,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:16,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:16,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118858776] [2019-11-15 23:53:16,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:16,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:53:16,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719212811] [2019-11-15 23:53:16,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:53:16,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:16,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:53:16,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:16,821 INFO L87 Difference]: Start difference. First operand 5079 states and 11339 transitions. Second operand 7 states. [2019-11-15 23:53:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:17,293 INFO L93 Difference]: Finished difference Result 5819 states and 12862 transitions. [2019-11-15 23:53:17,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:53:17,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-11-15 23:53:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:17,298 INFO L225 Difference]: With dead ends: 5819 [2019-11-15 23:53:17,298 INFO L226 Difference]: Without dead ends: 5766 [2019-11-15 23:53:17,299 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 23:53:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-11-15 23:53:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5166. [2019-11-15 23:53:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-15 23:53:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 11428 transitions. [2019-11-15 23:53:17,348 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 11428 transitions. Word has length 71 [2019-11-15 23:53:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:17,348 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 11428 transitions. [2019-11-15 23:53:17,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:53:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 11428 transitions. [2019-11-15 23:53:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:53:17,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:17,353 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:17,353 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:17,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:17,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1822532973, now seen corresponding path program 1 times [2019-11-15 23:53:17,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:17,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168117560] [2019-11-15 23:53:17,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:17,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:17,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:17,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168117560] [2019-11-15 23:53:17,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:17,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:53:17,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922556777] [2019-11-15 23:53:17,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:53:17,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:53:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:53:17,522 INFO L87 Difference]: Start difference. First operand 5166 states and 11428 transitions. Second operand 9 states. [2019-11-15 23:53:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:18,367 INFO L93 Difference]: Finished difference Result 7248 states and 16035 transitions. [2019-11-15 23:53:18,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:53:18,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-11-15 23:53:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:18,373 INFO L225 Difference]: With dead ends: 7248 [2019-11-15 23:53:18,373 INFO L226 Difference]: Without dead ends: 7220 [2019-11-15 23:53:18,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:53:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2019-11-15 23:53:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6152. [2019-11-15 23:53:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2019-11-15 23:53:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13790 transitions. [2019-11-15 23:53:18,436 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13790 transitions. Word has length 92 [2019-11-15 23:53:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:18,436 INFO L462 AbstractCegarLoop]: Abstraction has 6152 states and 13790 transitions. [2019-11-15 23:53:18,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:53:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13790 transitions. [2019-11-15 23:53:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:53:18,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:18,442 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:18,442 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:18,442 INFO L82 PathProgramCache]: Analyzing trace with hash -254676370, now seen corresponding path program 1 times [2019-11-15 23:53:18,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:18,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861008468] [2019-11-15 23:53:18,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:18,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:18,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:18,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861008468] [2019-11-15 23:53:18,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:18,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:18,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209581956] [2019-11-15 23:53:18,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:18,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:18,505 INFO L87 Difference]: Start difference. First operand 6152 states and 13790 transitions. Second operand 4 states. [2019-11-15 23:53:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:18,626 INFO L93 Difference]: Finished difference Result 7220 states and 16033 transitions. [2019-11-15 23:53:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:18,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 23:53:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:18,634 INFO L225 Difference]: With dead ends: 7220 [2019-11-15 23:53:18,635 INFO L226 Difference]: Without dead ends: 7220 [2019-11-15 23:53:18,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2019-11-15 23:53:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6335. [2019-11-15 23:53:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6335 states. [2019-11-15 23:53:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 14127 transitions. [2019-11-15 23:53:18,722 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 14127 transitions. Word has length 92 [2019-11-15 23:53:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:18,723 INFO L462 AbstractCegarLoop]: Abstraction has 6335 states and 14127 transitions. [2019-11-15 23:53:18,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 14127 transitions. [2019-11-15 23:53:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:18,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:18,731 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 23:53:18,731 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash -741091311, now seen corresponding path program 1 times [2019-11-15 23:53:18,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:18,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050824523] [2019-11-15 23:53:18,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:18,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:18,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:18,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050824523] [2019-11-15 23:53:18,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:18,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:18,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055343384] [2019-11-15 23:53:18,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:18,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:18,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:18,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:18,780 INFO L87 Difference]: Start difference. First operand 6335 states and 14127 transitions. Second operand 3 states. [2019-11-15 23:53:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:18,853 INFO L93 Difference]: Finished difference Result 6878 states and 15281 transitions. [2019-11-15 23:53:18,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:18,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 23:53:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:18,858 INFO L225 Difference]: With dead ends: 6878 [2019-11-15 23:53:18,858 INFO L226 Difference]: Without dead ends: 6878 [2019-11-15 23:53:18,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2019-11-15 23:53:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 6808. [2019-11-15 23:53:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6808 states. [2019-11-15 23:53:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 15131 transitions. [2019-11-15 23:53:18,918 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 15131 transitions. Word has length 94 [2019-11-15 23:53:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:18,918 INFO L462 AbstractCegarLoop]: Abstraction has 6808 states and 15131 transitions. [2019-11-15 23:53:18,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 15131 transitions. [2019-11-15 23:53:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:18,923 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:18,924 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 23:53:18,924 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1557627920, now seen corresponding path program 1 times [2019-11-15 23:53:18,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:18,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060605588] [2019-11-15 23:53:18,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:18,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:18,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:18,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060605588] [2019-11-15 23:53:18,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:18,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:53:18,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456983166] [2019-11-15 23:53:18,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:53:18,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:53:18,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:18,996 INFO L87 Difference]: Start difference. First operand 6808 states and 15131 transitions. Second operand 5 states. [2019-11-15 23:53:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:19,114 INFO L93 Difference]: Finished difference Result 7076 states and 15692 transitions. [2019-11-15 23:53:19,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:53:19,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 23:53:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:19,120 INFO L225 Difference]: With dead ends: 7076 [2019-11-15 23:53:19,120 INFO L226 Difference]: Without dead ends: 7076 [2019-11-15 23:53:19,120 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 23:53:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states. [2019-11-15 23:53:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 5598. [2019-11-15 23:53:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-11-15 23:53:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 12422 transitions. [2019-11-15 23:53:19,212 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 12422 transitions. Word has length 94 [2019-11-15 23:53:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:19,212 INFO L462 AbstractCegarLoop]: Abstraction has 5598 states and 12422 transitions. [2019-11-15 23:53:19,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:53:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 12422 transitions. [2019-11-15 23:53:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:19,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:19,219 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 23:53:19,219 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash 284400688, now seen corresponding path program 1 times [2019-11-15 23:53:19,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:19,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855226847] [2019-11-15 23:53:19,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:19,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:19,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:19,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855226847] [2019-11-15 23:53:19,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:19,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:53:19,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581396015] [2019-11-15 23:53:19,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:53:19,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:19,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:53:19,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:19,327 INFO L87 Difference]: Start difference. First operand 5598 states and 12422 transitions. Second operand 6 states. [2019-11-15 23:53:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:19,726 INFO L93 Difference]: Finished difference Result 6709 states and 14763 transitions. [2019-11-15 23:53:19,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:53:19,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 23:53:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:19,736 INFO L225 Difference]: With dead ends: 6709 [2019-11-15 23:53:19,736 INFO L226 Difference]: Without dead ends: 6709 [2019-11-15 23:53:19,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:53:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-11-15 23:53:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 5275. [2019-11-15 23:53:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5275 states. [2019-11-15 23:53:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 11760 transitions. [2019-11-15 23:53:19,817 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 11760 transitions. Word has length 94 [2019-11-15 23:53:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:19,818 INFO L462 AbstractCegarLoop]: Abstraction has 5275 states and 11760 transitions. [2019-11-15 23:53:19,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:53:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 11760 transitions. [2019-11-15 23:53:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:19,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:19,825 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 23:53:19,825 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1740516082, now seen corresponding path program 1 times [2019-11-15 23:53:19,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:19,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099812278] [2019-11-15 23:53:19,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:19,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:19,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:20,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099812278] [2019-11-15 23:53:20,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:20,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:53:20,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138997981] [2019-11-15 23:53:20,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:53:20,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:53:20,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:53:20,057 INFO L87 Difference]: Start difference. First operand 5275 states and 11760 transitions. Second operand 10 states. [2019-11-15 23:53:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:20,975 INFO L93 Difference]: Finished difference Result 6303 states and 13926 transitions. [2019-11-15 23:53:20,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:53:20,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-15 23:53:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:20,981 INFO L225 Difference]: With dead ends: 6303 [2019-11-15 23:53:20,981 INFO L226 Difference]: Without dead ends: 6287 [2019-11-15 23:53:20,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:53:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6287 states. [2019-11-15 23:53:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6287 to 5580. [2019-11-15 23:53:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5580 states. [2019-11-15 23:53:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 12441 transitions. [2019-11-15 23:53:21,038 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 12441 transitions. Word has length 94 [2019-11-15 23:53:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:21,038 INFO L462 AbstractCegarLoop]: Abstraction has 5580 states and 12441 transitions. [2019-11-15 23:53:21,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:53:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 12441 transitions. [2019-11-15 23:53:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:21,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:21,043 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 23:53:21,043 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash -336693261, now seen corresponding path program 1 times [2019-11-15 23:53:21,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:21,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769532780] [2019-11-15 23:53:21,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:21,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:21,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:21,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769532780] [2019-11-15 23:53:21,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:21,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:53:21,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862014007] [2019-11-15 23:53:21,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:53:21,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:53:21,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:21,150 INFO L87 Difference]: Start difference. First operand 5580 states and 12441 transitions. Second operand 6 states. [2019-11-15 23:53:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:21,329 INFO L93 Difference]: Finished difference Result 5442 states and 11943 transitions. [2019-11-15 23:53:21,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:53:21,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 23:53:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:21,335 INFO L225 Difference]: With dead ends: 5442 [2019-11-15 23:53:21,336 INFO L226 Difference]: Without dead ends: 5442 [2019-11-15 23:53:21,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2019-11-15 23:53:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 4838. [2019-11-15 23:53:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4838 states. [2019-11-15 23:53:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 10735 transitions. [2019-11-15 23:53:21,404 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 10735 transitions. Word has length 94 [2019-11-15 23:53:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:21,405 INFO L462 AbstractCegarLoop]: Abstraction has 4838 states and 10735 transitions. [2019-11-15 23:53:21,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:53:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 10735 transitions. [2019-11-15 23:53:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:21,410 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:21,410 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 23:53:21,411 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:21,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:21,411 INFO L82 PathProgramCache]: Analyzing trace with hash 819614451, now seen corresponding path program 1 times [2019-11-15 23:53:21,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:21,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280824674] [2019-11-15 23:53:21,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:21,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:21,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:21,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280824674] [2019-11-15 23:53:21,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:21,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:53:21,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762967417] [2019-11-15 23:53:21,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:53:21,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:21,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:53:21,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:53:21,604 INFO L87 Difference]: Start difference. First operand 4838 states and 10735 transitions. Second operand 9 states. [2019-11-15 23:53:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:22,390 INFO L93 Difference]: Finished difference Result 6317 states and 13852 transitions. [2019-11-15 23:53:22,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:53:22,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-15 23:53:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:22,397 INFO L225 Difference]: With dead ends: 6317 [2019-11-15 23:53:22,397 INFO L226 Difference]: Without dead ends: 6317 [2019-11-15 23:53:22,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:53:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2019-11-15 23:53:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5263. [2019-11-15 23:53:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5263 states. [2019-11-15 23:53:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 11595 transitions. [2019-11-15 23:53:22,474 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 11595 transitions. Word has length 94 [2019-11-15 23:53:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:22,475 INFO L462 AbstractCegarLoop]: Abstraction has 5263 states and 11595 transitions. [2019-11-15 23:53:22,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:53:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 11595 transitions. [2019-11-15 23:53:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:22,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:22,481 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 23:53:22,482 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1030965364, now seen corresponding path program 1 times [2019-11-15 23:53:22,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:22,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668415317] [2019-11-15 23:53:22,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:22,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:22,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:22,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668415317] [2019-11-15 23:53:22,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:22,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:53:22,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798797456] [2019-11-15 23:53:22,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:53:22,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:53:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:53:22,658 INFO L87 Difference]: Start difference. First operand 5263 states and 11595 transitions. Second operand 9 states. [2019-11-15 23:53:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:23,285 INFO L93 Difference]: Finished difference Result 6028 states and 13188 transitions. [2019-11-15 23:53:23,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:53:23,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-15 23:53:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:23,292 INFO L225 Difference]: With dead ends: 6028 [2019-11-15 23:53:23,292 INFO L226 Difference]: Without dead ends: 6028 [2019-11-15 23:53:23,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:53:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2019-11-15 23:53:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 5575. [2019-11-15 23:53:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5575 states. [2019-11-15 23:53:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 12249 transitions. [2019-11-15 23:53:23,375 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 12249 transitions. Word has length 94 [2019-11-15 23:53:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:23,375 INFO L462 AbstractCegarLoop]: Abstraction has 5575 states and 12249 transitions. [2019-11-15 23:53:23,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:53:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 12249 transitions. [2019-11-15 23:53:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:23,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:23,383 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 23:53:23,383 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1918469045, now seen corresponding path program 1 times [2019-11-15 23:53:23,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:23,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653124605] [2019-11-15 23:53:23,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:23,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:23,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:23,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653124605] [2019-11-15 23:53:23,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:23,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:53:23,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970621694] [2019-11-15 23:53:23,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:53:23,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:23,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:53:23,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:53:23,615 INFO L87 Difference]: Start difference. First operand 5575 states and 12249 transitions. Second operand 10 states. [2019-11-15 23:53:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:24,331 INFO L93 Difference]: Finished difference Result 21556 states and 48001 transitions. [2019-11-15 23:53:24,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:53:24,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-15 23:53:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:24,342 INFO L225 Difference]: With dead ends: 21556 [2019-11-15 23:53:24,342 INFO L226 Difference]: Without dead ends: 12443 [2019-11-15 23:53:24,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:53:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12443 states. [2019-11-15 23:53:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12443 to 5226. [2019-11-15 23:53:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5226 states. [2019-11-15 23:53:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 11417 transitions. [2019-11-15 23:53:24,422 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 11417 transitions. Word has length 94 [2019-11-15 23:53:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:24,423 INFO L462 AbstractCegarLoop]: Abstraction has 5226 states and 11417 transitions. [2019-11-15 23:53:24,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:53:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 11417 transitions. [2019-11-15 23:53:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:24,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:24,427 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 23:53:24,427 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:24,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:24,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1724237327, now seen corresponding path program 2 times [2019-11-15 23:53:24,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:24,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159729174] [2019-11-15 23:53:24,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:24,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:24,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:24,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159729174] [2019-11-15 23:53:24,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:24,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:53:24,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182268134] [2019-11-15 23:53:24,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:53:24,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:24,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:53:24,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:24,558 INFO L87 Difference]: Start difference. First operand 5226 states and 11417 transitions. Second operand 5 states. [2019-11-15 23:53:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:24,617 INFO L93 Difference]: Finished difference Result 5396 states and 11680 transitions. [2019-11-15 23:53:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:24,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 23:53:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:24,623 INFO L225 Difference]: With dead ends: 5396 [2019-11-15 23:53:24,623 INFO L226 Difference]: Without dead ends: 5396 [2019-11-15 23:53:24,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:53:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2019-11-15 23:53:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5291. [2019-11-15 23:53:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5291 states. [2019-11-15 23:53:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 11465 transitions. [2019-11-15 23:53:24,692 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 11465 transitions. Word has length 94 [2019-11-15 23:53:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:24,692 INFO L462 AbstractCegarLoop]: Abstraction has 5291 states and 11465 transitions. [2019-11-15 23:53:24,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:53:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 11465 transitions. [2019-11-15 23:53:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:53:24,698 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:24,699 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 23:53:24,699 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 459439600, now seen corresponding path program 1 times [2019-11-15 23:53:24,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:24,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230549499] [2019-11-15 23:53:24,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:24,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:24,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:24,788 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:53:24,789 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:53:24,955 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:53:24,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:53:24 BasicIcfg [2019-11-15 23:53:24,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:53:24,968 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:53:24,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:53:24,969 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:53:24,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:43" (3/4) ... [2019-11-15 23:53:24,972 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:53:25,142 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2a7db04a-8530-4947-80f6-ac7f1938cc2a/bin/uautomizer/witness.graphml [2019-11-15 23:53:25,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:53:25,145 INFO L168 Benchmark]: Toolchain (without parser) took 43427.77 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 940.6 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:53:25,145 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:53:25,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:25,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:25,148 INFO L168 Benchmark]: Boogie Preprocessor took 39.23 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:25,148 INFO L168 Benchmark]: RCFGBuilder took 794.03 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: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:25,149 INFO L168 Benchmark]: TraceAbstraction took 41732.86 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:53:25,149 INFO L168 Benchmark]: Witness Printer took 174.03 ms. Allocated memory is still 4.6 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:25,151 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 625.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.23 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 794.03 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: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41732.86 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 174.03 ms. Allocated memory is still 4.6 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1441; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1442; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 217 locations, 3 error locations. Result: UNSAFE, OverallTime: 41.5s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9503 SDtfs, 10380 SDslu, 23032 SDs, 0 SdLazy, 9222 SolverSat, 506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 90 SyntacticMatches, 28 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71010occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 76845 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2402 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 510707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...