./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/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 8a12e820a88074900da255d7fe5ba4376f9d676a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:41:01,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:41:01,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:41:01,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:41:01,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:41:01,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:41:01,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:41:01,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:41:01,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:41:01,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:41:01,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:41:01,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:41:01,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:41:01,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:41:01,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:41:01,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:41:01,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:41:01,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:41:01,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:41:01,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:41:01,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:41:01,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:41:01,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:41:01,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:41:01,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:41:01,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:41:01,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:41:01,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:41:01,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:41:01,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:41:01,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:41:01,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:41:01,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:41:01,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:41:01,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:41:01,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:41:01,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:41:01,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:41:01,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:41:01,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:41:01,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:41:01,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:41:01,669 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:41:01,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:41:01,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:41:01,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:41:01,671 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:41:01,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:41:01,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:41:01,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:41:01,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:41:01,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:41:01,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:41:01,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:41:01,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:41:01,673 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:41:01,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:41:01,673 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:41:01,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:41:01,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:41:01,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:41:01,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:41:01,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:41:01,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:41:01,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:41:01,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:41:01,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:41:01,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:41:01,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:41:01,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:41:01,688 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_23de26b8-c716-47a0-abf1-197077734870/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 -> 8a12e820a88074900da255d7fe5ba4376f9d676a [2019-11-15 20:41:01,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:41:01,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:41:01,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:41:01,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:41:01,749 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:41:01,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr000_power.opt.i [2019-11-15 20:41:01,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/data/7c82e293a/016b1811ddf7499c8622f187ffc3c6bd/FLAG0ad781b17 [2019-11-15 20:41:02,390 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:41:02,393 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/sv-benchmarks/c/pthread-wmm/podwr000_power.opt.i [2019-11-15 20:41:02,414 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/data/7c82e293a/016b1811ddf7499c8622f187ffc3c6bd/FLAG0ad781b17 [2019-11-15 20:41:02,636 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/data/7c82e293a/016b1811ddf7499c8622f187ffc3c6bd [2019-11-15 20:41:02,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:41:02,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:41:02,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:41:02,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:41:02,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:41:02,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:41:02" (1/1) ... [2019-11-15 20:41:02,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9aaf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:02, skipping insertion in model container [2019-11-15 20:41:02,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:41:02" (1/1) ... [2019-11-15 20:41:02,659 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:41:02,705 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:41:03,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:41:03,301 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:41:03,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:41:03,475 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:41:03,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03 WrapperNode [2019-11-15 20:41:03,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:41:03,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:41:03,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:41:03,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:41:03,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:41:03,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:41:03,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:41:03,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:41:03,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... [2019-11-15 20:41:03,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:41:03,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:41:03,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:41:03,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:41:03,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:41:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:41:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:41:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:41:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:41:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:41:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:41:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:41:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:41:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:41:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:41:03,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:41:03,705 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 20:41:04,598 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:41:04,598 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:41:04,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:41:04 BoogieIcfgContainer [2019-11-15 20:41:04,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:41:04,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:41:04,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:41:04,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:41:04,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:41:02" (1/3) ... [2019-11-15 20:41:04,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e361175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:41:04, skipping insertion in model container [2019-11-15 20:41:04,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:41:03" (2/3) ... [2019-11-15 20:41:04,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e361175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:41:04, skipping insertion in model container [2019-11-15 20:41:04,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:41:04" (3/3) ... [2019-11-15 20:41:04,607 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_power.opt.i [2019-11-15 20:41:04,651 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,652 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,652 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,652 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,652 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,652 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,653 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,653 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,654 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,657 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,657 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,657 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,658 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,658 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,658 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,658 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,659 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,659 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,659 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,659 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,662 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,662 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,664 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,664 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,664 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,664 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,666 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,666 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,672 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,672 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,672 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,672 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,673 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,673 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,673 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,673 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,676 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,676 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,676 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,676 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,677 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,677 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,677 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,677 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,677 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,678 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,678 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,678 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,678 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,678 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,679 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,679 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,679 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,679 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,679 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,680 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,680 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,680 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,680 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,681 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,681 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,681 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,681 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,682 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,682 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,682 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,682 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,682 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,683 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,683 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,683 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,683 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,684 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,684 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,684 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,684 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,685 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,685 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,685 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,685 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,685 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,686 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,686 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,686 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,686 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,686 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,687 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,687 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,687 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,687 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,688 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,688 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,688 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,688 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,688 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,689 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,689 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,689 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,689 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,690 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,690 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,690 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,690 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,691 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,691 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,691 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,691 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:41:04,698 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:41:04,698 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:41:04,707 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:41:04,717 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:41:04,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:41:04,739 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:41:04,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:41:04,739 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:41:04,739 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:41:04,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:41:04,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:41:04,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:41:04,754 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 20:41:07,671 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 20:41:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 20:41:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 20:41:07,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:07,684 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:07,686 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:07,693 INFO L82 PathProgramCache]: Analyzing trace with hash -254800073, now seen corresponding path program 1 times [2019-11-15 20:41:07,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:07,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645011629] [2019-11-15 20:41:07,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:07,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:07,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:08,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645011629] [2019-11-15 20:41:08,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:08,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:41:08,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194957285] [2019-11-15 20:41:08,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:41:08,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:08,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:41:08,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:08,038 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 20:41:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:09,211 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 20:41:09,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:41:09,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 20:41:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:09,535 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 20:41:09,535 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 20:41:09,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 20:41:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 20:41:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 20:41:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 20:41:11,354 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 20:41:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:11,357 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 20:41:11,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:41:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 20:41:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:41:11,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:11,372 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 20:41:11,373 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -250081261, now seen corresponding path program 1 times [2019-11-15 20:41:11,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:11,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737458739] [2019-11-15 20:41:11,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:11,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:11,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:11,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737458739] [2019-11-15 20:41:11,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:11,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:41:11,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417936836] [2019-11-15 20:41:11,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:41:11,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:41:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:11,526 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 20:41:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:12,986 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 20:41:12,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:41:12,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 20:41:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:13,187 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 20:41:13,187 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 20:41:13,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:41:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 20:41:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 20:41:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 20:41:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 20:41:15,367 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 20:41:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:15,376 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 20:41:15,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:41:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 20:41:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 20:41:15,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:15,384 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:15,385 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1037182150, now seen corresponding path program 1 times [2019-11-15 20:41:15,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:15,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475838617] [2019-11-15 20:41:15,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:15,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:15,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:15,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475838617] [2019-11-15 20:41:15,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:15,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:41:15,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28553096] [2019-11-15 20:41:15,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:41:15,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:15,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:41:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:15,526 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 20:41:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:16,915 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 20:41:16,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:41:16,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 20:41:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:17,162 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 20:41:17,162 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 20:41:17,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:41:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 20:41:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 20:41:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 20:41:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 20:41:18,543 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 20:41:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:18,544 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 20:41:18,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:41:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 20:41:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 20:41:18,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:18,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:18,558 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:18,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:18,558 INFO L82 PathProgramCache]: Analyzing trace with hash 671596896, now seen corresponding path program 1 times [2019-11-15 20:41:18,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:18,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435158572] [2019-11-15 20:41:18,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:18,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:18,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:18,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435158572] [2019-11-15 20:41:18,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:18,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:41:18,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147302788] [2019-11-15 20:41:18,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:41:18,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:18,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:41:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:41:18,613 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 20:41:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:19,006 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 20:41:19,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:41:19,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 20:41:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:20,000 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 20:41:20,000 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 20:41:20,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:41:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 20:41:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 20:41:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 20:41:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 20:41:21,353 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 20:41:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:21,354 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 20:41:21,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:41:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 20:41:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:41:21,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:21,375 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:21,375 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash -934557998, now seen corresponding path program 1 times [2019-11-15 20:41:21,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:21,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499678408] [2019-11-15 20:41:21,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:21,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:21,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:21,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499678408] [2019-11-15 20:41:21,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:21,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:21,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389764730] [2019-11-15 20:41:21,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:21,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:21,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:21,550 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 20:41:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:23,011 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-15 20:41:23,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:41:23,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 20:41:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:23,179 INFO L225 Difference]: With dead ends: 63755 [2019-11-15 20:41:23,180 INFO L226 Difference]: Without dead ends: 63755 [2019-11-15 20:41:23,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:41:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-15 20:41:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-15 20:41:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-15 20:41:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-15 20:41:24,451 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-15 20:41:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:24,451 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-15 20:41:24,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-15 20:41:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:41:24,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:24,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:24,474 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1563457939, now seen corresponding path program 1 times [2019-11-15 20:41:24,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:24,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973487477] [2019-11-15 20:41:24,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:24,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:24,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:24,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973487477] [2019-11-15 20:41:24,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:24,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:41:24,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878019160] [2019-11-15 20:41:24,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:41:24,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:41:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:41:24,603 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-11-15 20:41:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:26,509 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-11-15 20:41:26,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:41:26,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-15 20:41:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:26,688 INFO L225 Difference]: With dead ends: 83684 [2019-11-15 20:41:26,688 INFO L226 Difference]: Without dead ends: 83684 [2019-11-15 20:41:26,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:41:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-11-15 20:41:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-11-15 20:41:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-11-15 20:41:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-11-15 20:41:28,175 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-11-15 20:41:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:28,175 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-11-15 20:41:28,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:41:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-11-15 20:41:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:41:28,193 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:28,193 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:28,193 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:28,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:28,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1844005676, now seen corresponding path program 1 times [2019-11-15 20:41:28,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:28,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952239171] [2019-11-15 20:41:28,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:28,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:28,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:28,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952239171] [2019-11-15 20:41:28,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:28,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:41:28,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186143661] [2019-11-15 20:41:28,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:41:28,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:41:28,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:41:28,258 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 3 states. [2019-11-15 20:41:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:28,596 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-11-15 20:41:28,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:41:28,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 20:41:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:29,288 INFO L225 Difference]: With dead ends: 54020 [2019-11-15 20:41:29,288 INFO L226 Difference]: Without dead ends: 54020 [2019-11-15 20:41:29,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:41:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-11-15 20:41:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-11-15 20:41:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-11-15 20:41:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-11-15 20:41:30,315 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-11-15 20:41:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:30,317 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-11-15 20:41:30,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:41:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-11-15 20:41:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:41:30,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:30,330 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:30,331 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash -456832597, now seen corresponding path program 1 times [2019-11-15 20:41:30,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:30,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084502355] [2019-11-15 20:41:30,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:30,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:30,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:30,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084502355] [2019-11-15 20:41:30,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:30,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:30,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682542232] [2019-11-15 20:41:30,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:30,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:30,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:30,491 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-11-15 20:41:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:31,379 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-11-15 20:41:31,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:41:31,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 20:41:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:31,521 INFO L225 Difference]: With dead ends: 68645 [2019-11-15 20:41:31,522 INFO L226 Difference]: Without dead ends: 68077 [2019-11-15 20:41:31,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:41:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-11-15 20:41:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-11-15 20:41:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-11-15 20:41:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-11-15 20:41:32,742 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-11-15 20:41:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:32,742 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-11-15 20:41:32,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-11-15 20:41:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:41:32,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:32,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:32,755 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1423918431, now seen corresponding path program 1 times [2019-11-15 20:41:32,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:32,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039201610] [2019-11-15 20:41:32,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:32,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:32,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:32,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039201610] [2019-11-15 20:41:32,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:32,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:32,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314471189] [2019-11-15 20:41:32,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:32,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:32,866 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 6 states. [2019-11-15 20:41:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:34,068 INFO L93 Difference]: Finished difference Result 96424 states and 331752 transitions. [2019-11-15 20:41:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:41:34,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 20:41:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:34,286 INFO L225 Difference]: With dead ends: 96424 [2019-11-15 20:41:34,286 INFO L226 Difference]: Without dead ends: 96424 [2019-11-15 20:41:34,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:41:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96424 states. [2019-11-15 20:41:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96424 to 70773. [2019-11-15 20:41:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70773 states. [2019-11-15 20:41:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70773 states to 70773 states and 244809 transitions. [2019-11-15 20:41:35,827 INFO L78 Accepts]: Start accepts. Automaton has 70773 states and 244809 transitions. Word has length 53 [2019-11-15 20:41:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:35,827 INFO L462 AbstractCegarLoop]: Abstraction has 70773 states and 244809 transitions. [2019-11-15 20:41:35,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 70773 states and 244809 transitions. [2019-11-15 20:41:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:41:35,840 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:35,840 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:35,841 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash -536414750, now seen corresponding path program 1 times [2019-11-15 20:41:35,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:35,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618405408] [2019-11-15 20:41:35,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:35,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:35,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:35,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618405408] [2019-11-15 20:41:35,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:35,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:41:35,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882489155] [2019-11-15 20:41:35,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:41:35,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:41:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:35,938 INFO L87 Difference]: Start difference. First operand 70773 states and 244809 transitions. Second operand 4 states. [2019-11-15 20:41:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:35,999 INFO L93 Difference]: Finished difference Result 12386 states and 37621 transitions. [2019-11-15 20:41:36,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:41:36,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-15 20:41:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:36,016 INFO L225 Difference]: With dead ends: 12386 [2019-11-15 20:41:36,016 INFO L226 Difference]: Without dead ends: 10681 [2019-11-15 20:41:36,017 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 20:41:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10681 states. [2019-11-15 20:41:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10681 to 10633. [2019-11-15 20:41:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2019-11-15 20:41:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 31700 transitions. [2019-11-15 20:41:36,161 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 31700 transitions. Word has length 53 [2019-11-15 20:41:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:36,161 INFO L462 AbstractCegarLoop]: Abstraction has 10633 states and 31700 transitions. [2019-11-15 20:41:36,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:41:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 31700 transitions. [2019-11-15 20:41:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:41:36,164 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:36,164 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:36,165 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:36,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash -257891193, now seen corresponding path program 1 times [2019-11-15 20:41:36,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:36,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156587460] [2019-11-15 20:41:36,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:36,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:36,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:36,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156587460] [2019-11-15 20:41:36,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:36,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:41:36,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861792713] [2019-11-15 20:41:36,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:41:36,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:36,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:41:36,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:36,231 INFO L87 Difference]: Start difference. First operand 10633 states and 31700 transitions. Second operand 4 states. [2019-11-15 20:41:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:36,391 INFO L93 Difference]: Finished difference Result 12165 states and 36338 transitions. [2019-11-15 20:41:36,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:41:36,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 20:41:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:36,414 INFO L225 Difference]: With dead ends: 12165 [2019-11-15 20:41:36,415 INFO L226 Difference]: Without dead ends: 12165 [2019-11-15 20:41:36,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-11-15 20:41:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 10963. [2019-11-15 20:41:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10963 states. [2019-11-15 20:41:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10963 states to 10963 states and 32702 transitions. [2019-11-15 20:41:36,626 INFO L78 Accepts]: Start accepts. Automaton has 10963 states and 32702 transitions. Word has length 60 [2019-11-15 20:41:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:36,627 INFO L462 AbstractCegarLoop]: Abstraction has 10963 states and 32702 transitions. [2019-11-15 20:41:36,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:41:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 10963 states and 32702 transitions. [2019-11-15 20:41:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:41:36,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:36,630 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:36,630 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1484919142, now seen corresponding path program 1 times [2019-11-15 20:41:36,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:36,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359774919] [2019-11-15 20:41:36,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:36,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:36,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:36,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359774919] [2019-11-15 20:41:36,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:36,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:36,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846400577] [2019-11-15 20:41:36,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:36,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:36,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:36,717 INFO L87 Difference]: Start difference. First operand 10963 states and 32702 transitions. Second operand 6 states. [2019-11-15 20:41:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:37,145 INFO L93 Difference]: Finished difference Result 13789 states and 40570 transitions. [2019-11-15 20:41:37,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:41:37,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 20:41:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:37,164 INFO L225 Difference]: With dead ends: 13789 [2019-11-15 20:41:37,164 INFO L226 Difference]: Without dead ends: 13728 [2019-11-15 20:41:37,164 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 20:41:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13728 states. [2019-11-15 20:41:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13728 to 12854. [2019-11-15 20:41:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12854 states. [2019-11-15 20:41:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12854 states to 12854 states and 38040 transitions. [2019-11-15 20:41:37,381 INFO L78 Accepts]: Start accepts. Automaton has 12854 states and 38040 transitions. Word has length 60 [2019-11-15 20:41:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:37,382 INFO L462 AbstractCegarLoop]: Abstraction has 12854 states and 38040 transitions. [2019-11-15 20:41:37,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 12854 states and 38040 transitions. [2019-11-15 20:41:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:41:37,388 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:37,388 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:37,388 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1081136040, now seen corresponding path program 1 times [2019-11-15 20:41:37,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:37,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749834926] [2019-11-15 20:41:37,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:37,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:37,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:37,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749834926] [2019-11-15 20:41:37,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:37,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:41:37,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101450848] [2019-11-15 20:41:37,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:41:37,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:41:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:37,470 INFO L87 Difference]: Start difference. First operand 12854 states and 38040 transitions. Second operand 4 states. [2019-11-15 20:41:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:37,876 INFO L93 Difference]: Finished difference Result 15947 states and 46763 transitions. [2019-11-15 20:41:37,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:41:37,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 20:41:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:37,898 INFO L225 Difference]: With dead ends: 15947 [2019-11-15 20:41:37,898 INFO L226 Difference]: Without dead ends: 15947 [2019-11-15 20:41:37,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2019-11-15 20:41:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 14216. [2019-11-15 20:41:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-11-15 20:41:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 41815 transitions. [2019-11-15 20:41:38,103 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 41815 transitions. Word has length 66 [2019-11-15 20:41:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:38,104 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 41815 transitions. [2019-11-15 20:41:38,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:41:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 41815 transitions. [2019-11-15 20:41:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:41:38,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:38,111 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:38,111 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1969066775, now seen corresponding path program 1 times [2019-11-15 20:41:38,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:38,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357605372] [2019-11-15 20:41:38,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:38,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:38,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:38,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357605372] [2019-11-15 20:41:38,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:38,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:38,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914146238] [2019-11-15 20:41:38,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:38,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:38,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:38,225 INFO L87 Difference]: Start difference. First operand 14216 states and 41815 transitions. Second operand 6 states. [2019-11-15 20:41:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:38,818 INFO L93 Difference]: Finished difference Result 15413 states and 44700 transitions. [2019-11-15 20:41:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:41:38,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:41:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:38,842 INFO L225 Difference]: With dead ends: 15413 [2019-11-15 20:41:38,842 INFO L226 Difference]: Without dead ends: 15413 [2019-11-15 20:41:38,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:41:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15413 states. [2019-11-15 20:41:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15413 to 15089. [2019-11-15 20:41:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15089 states. [2019-11-15 20:41:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 43878 transitions. [2019-11-15 20:41:39,052 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 43878 transitions. Word has length 66 [2019-11-15 20:41:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:39,052 INFO L462 AbstractCegarLoop]: Abstraction has 15089 states and 43878 transitions. [2019-11-15 20:41:39,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 43878 transitions. [2019-11-15 20:41:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:41:39,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:39,062 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:39,063 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1007452758, now seen corresponding path program 1 times [2019-11-15 20:41:39,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:39,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644170688] [2019-11-15 20:41:39,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:39,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:39,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:39,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644170688] [2019-11-15 20:41:39,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:39,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:39,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125010237] [2019-11-15 20:41:39,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:39,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:39,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:39,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:39,169 INFO L87 Difference]: Start difference. First operand 15089 states and 43878 transitions. Second operand 6 states. [2019-11-15 20:41:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:39,639 INFO L93 Difference]: Finished difference Result 17155 states and 48592 transitions. [2019-11-15 20:41:39,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:41:39,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:41:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:39,670 INFO L225 Difference]: With dead ends: 17155 [2019-11-15 20:41:39,670 INFO L226 Difference]: Without dead ends: 17155 [2019-11-15 20:41:39,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:41:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17155 states. [2019-11-15 20:41:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17155 to 15619. [2019-11-15 20:41:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15619 states. [2019-11-15 20:41:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15619 states to 15619 states and 44726 transitions. [2019-11-15 20:41:39,893 INFO L78 Accepts]: Start accepts. Automaton has 15619 states and 44726 transitions. Word has length 66 [2019-11-15 20:41:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:39,893 INFO L462 AbstractCegarLoop]: Abstraction has 15619 states and 44726 transitions. [2019-11-15 20:41:39,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 15619 states and 44726 transitions. [2019-11-15 20:41:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:41:39,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:39,903 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:39,903 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:39,904 INFO L82 PathProgramCache]: Analyzing trace with hash -796101845, now seen corresponding path program 1 times [2019-11-15 20:41:39,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:39,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677780126] [2019-11-15 20:41:39,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:39,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:39,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:40,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677780126] [2019-11-15 20:41:40,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:40,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:41:40,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671167899] [2019-11-15 20:41:40,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:41:40,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:40,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:41:40,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:40,022 INFO L87 Difference]: Start difference. First operand 15619 states and 44726 transitions. Second operand 5 states. [2019-11-15 20:41:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:40,354 INFO L93 Difference]: Finished difference Result 19634 states and 55999 transitions. [2019-11-15 20:41:40,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:41:40,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:41:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:40,380 INFO L225 Difference]: With dead ends: 19634 [2019-11-15 20:41:40,380 INFO L226 Difference]: Without dead ends: 19634 [2019-11-15 20:41:40,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:41:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2019-11-15 20:41:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 18191. [2019-11-15 20:41:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18191 states. [2019-11-15 20:41:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18191 states to 18191 states and 51753 transitions. [2019-11-15 20:41:40,643 INFO L78 Accepts]: Start accepts. Automaton has 18191 states and 51753 transitions. Word has length 66 [2019-11-15 20:41:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:40,643 INFO L462 AbstractCegarLoop]: Abstraction has 18191 states and 51753 transitions. [2019-11-15 20:41:40,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:41:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18191 states and 51753 transitions. [2019-11-15 20:41:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:41:40,651 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:40,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:40,652 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1306636022, now seen corresponding path program 1 times [2019-11-15 20:41:40,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:40,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432616854] [2019-11-15 20:41:40,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:40,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:40,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:40,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432616854] [2019-11-15 20:41:40,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:40,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:41:40,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493856690] [2019-11-15 20:41:40,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:41:40,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:40,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:41:40,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:40,719 INFO L87 Difference]: Start difference. First operand 18191 states and 51753 transitions. Second operand 4 states. [2019-11-15 20:41:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:41,240 INFO L93 Difference]: Finished difference Result 21605 states and 61304 transitions. [2019-11-15 20:41:41,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:41:41,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 20:41:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:41,269 INFO L225 Difference]: With dead ends: 21605 [2019-11-15 20:41:41,269 INFO L226 Difference]: Without dead ends: 21383 [2019-11-15 20:41:41,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21383 states. [2019-11-15 20:41:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21383 to 20513. [2019-11-15 20:41:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20513 states. [2019-11-15 20:41:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 58140 transitions. [2019-11-15 20:41:41,550 INFO L78 Accepts]: Start accepts. Automaton has 20513 states and 58140 transitions. Word has length 66 [2019-11-15 20:41:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:41,550 INFO L462 AbstractCegarLoop]: Abstraction has 20513 states and 58140 transitions. [2019-11-15 20:41:41,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:41:41,551 INFO L276 IsEmpty]: Start isEmpty. Operand 20513 states and 58140 transitions. [2019-11-15 20:41:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:41:41,561 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:41,561 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:41,561 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 303876234, now seen corresponding path program 1 times [2019-11-15 20:41:41,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:41,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647191707] [2019-11-15 20:41:41,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:41,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:41,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:41,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647191707] [2019-11-15 20:41:41,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:41,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:41:41,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413284245] [2019-11-15 20:41:41,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:41:41,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:41,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:41:41,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:41:41,701 INFO L87 Difference]: Start difference. First operand 20513 states and 58140 transitions. Second operand 9 states. [2019-11-15 20:41:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:42,686 INFO L93 Difference]: Finished difference Result 27608 states and 77920 transitions. [2019-11-15 20:41:42,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:41:42,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-15 20:41:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:42,726 INFO L225 Difference]: With dead ends: 27608 [2019-11-15 20:41:42,727 INFO L226 Difference]: Without dead ends: 27608 [2019-11-15 20:41:42,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:41:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27608 states. [2019-11-15 20:41:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27608 to 23102. [2019-11-15 20:41:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23102 states. [2019-11-15 20:41:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23102 states to 23102 states and 65204 transitions. [2019-11-15 20:41:43,059 INFO L78 Accepts]: Start accepts. Automaton has 23102 states and 65204 transitions. Word has length 66 [2019-11-15 20:41:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:43,059 INFO L462 AbstractCegarLoop]: Abstraction has 23102 states and 65204 transitions. [2019-11-15 20:41:43,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:41:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 23102 states and 65204 transitions. [2019-11-15 20:41:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:41:43,068 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:43,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:43,068 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1191379915, now seen corresponding path program 1 times [2019-11-15 20:41:43,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:43,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647230315] [2019-11-15 20:41:43,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:43,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:43,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:43,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647230315] [2019-11-15 20:41:43,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:43,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:41:43,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63956414] [2019-11-15 20:41:43,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:41:43,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:41:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:43,172 INFO L87 Difference]: Start difference. First operand 23102 states and 65204 transitions. Second operand 5 states. [2019-11-15 20:41:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:43,239 INFO L93 Difference]: Finished difference Result 6392 states and 15091 transitions. [2019-11-15 20:41:43,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:41:43,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:41:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:43,247 INFO L225 Difference]: With dead ends: 6392 [2019-11-15 20:41:43,247 INFO L226 Difference]: Without dead ends: 5432 [2019-11-15 20:41:43,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:41:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5432 states. [2019-11-15 20:41:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5432 to 4684. [2019-11-15 20:41:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-11-15 20:41:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 10759 transitions. [2019-11-15 20:41:43,324 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 10759 transitions. Word has length 66 [2019-11-15 20:41:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:43,325 INFO L462 AbstractCegarLoop]: Abstraction has 4684 states and 10759 transitions. [2019-11-15 20:41:43,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:41:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 10759 transitions. [2019-11-15 20:41:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:41:43,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:43,330 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:43,330 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1738873321, now seen corresponding path program 1 times [2019-11-15 20:41:43,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:43,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878675245] [2019-11-15 20:41:43,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:43,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:43,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:43,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878675245] [2019-11-15 20:41:43,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:43,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:41:43,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853953982] [2019-11-15 20:41:43,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:41:43,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:43,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:41:43,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:41:43,368 INFO L87 Difference]: Start difference. First operand 4684 states and 10759 transitions. Second operand 3 states. [2019-11-15 20:41:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:43,409 INFO L93 Difference]: Finished difference Result 5801 states and 13142 transitions. [2019-11-15 20:41:43,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:41:43,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 20:41:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:43,414 INFO L225 Difference]: With dead ends: 5801 [2019-11-15 20:41:43,414 INFO L226 Difference]: Without dead ends: 5801 [2019-11-15 20:41:43,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:41:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-11-15 20:41:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 4607. [2019-11-15 20:41:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-11-15 20:41:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 10306 transitions. [2019-11-15 20:41:43,467 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 10306 transitions. Word has length 66 [2019-11-15 20:41:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:43,467 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 10306 transitions. [2019-11-15 20:41:43,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:41:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 10306 transitions. [2019-11-15 20:41:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:41:43,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:43,471 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:43,471 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1014352042, now seen corresponding path program 1 times [2019-11-15 20:41:43,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:43,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784476742] [2019-11-15 20:41:43,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:43,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:43,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:43,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784476742] [2019-11-15 20:41:43,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:43,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:41:43,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401320282] [2019-11-15 20:41:43,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:41:43,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:43,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:41:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:43,535 INFO L87 Difference]: Start difference. First operand 4607 states and 10306 transitions. Second operand 5 states. [2019-11-15 20:41:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:43,772 INFO L93 Difference]: Finished difference Result 5678 states and 12754 transitions. [2019-11-15 20:41:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:41:43,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 20:41:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:43,781 INFO L225 Difference]: With dead ends: 5678 [2019-11-15 20:41:43,782 INFO L226 Difference]: Without dead ends: 5678 [2019-11-15 20:41:43,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:41:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2019-11-15 20:41:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5027. [2019-11-15 20:41:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-15 20:41:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 11264 transitions. [2019-11-15 20:41:43,886 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 11264 transitions. Word has length 72 [2019-11-15 20:41:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:43,886 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 11264 transitions. [2019-11-15 20:41:43,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:41:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 11264 transitions. [2019-11-15 20:41:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:41:43,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:43,895 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:43,895 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:43,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:43,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1537804919, now seen corresponding path program 1 times [2019-11-15 20:41:43,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:43,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766943215] [2019-11-15 20:41:43,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:43,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:43,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:43,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766943215] [2019-11-15 20:41:43,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:43,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:41:43,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871019595] [2019-11-15 20:41:43,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:41:43,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:43,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:41:43,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:41:43,980 INFO L87 Difference]: Start difference. First operand 5027 states and 11264 transitions. Second operand 7 states. [2019-11-15 20:41:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:44,541 INFO L93 Difference]: Finished difference Result 5893 states and 13110 transitions. [2019-11-15 20:41:44,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:41:44,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 20:41:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:44,547 INFO L225 Difference]: With dead ends: 5893 [2019-11-15 20:41:44,548 INFO L226 Difference]: Without dead ends: 5840 [2019-11-15 20:41:44,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:41:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5840 states. [2019-11-15 20:41:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5840 to 5058. [2019-11-15 20:41:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5058 states. [2019-11-15 20:41:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 11264 transitions. [2019-11-15 20:41:44,624 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 11264 transitions. Word has length 72 [2019-11-15 20:41:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:44,624 INFO L462 AbstractCegarLoop]: Abstraction has 5058 states and 11264 transitions. [2019-11-15 20:41:44,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:41:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 11264 transitions. [2019-11-15 20:41:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:41:44,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:44,630 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:44,631 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:44,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash -348323270, now seen corresponding path program 1 times [2019-11-15 20:41:44,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:44,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090814885] [2019-11-15 20:41:44,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:44,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:44,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:44,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090814885] [2019-11-15 20:41:44,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:44,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:41:44,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99241427] [2019-11-15 20:41:44,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:41:44,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:41:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:44,695 INFO L87 Difference]: Start difference. First operand 5058 states and 11264 transitions. Second operand 5 states. [2019-11-15 20:41:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:45,015 INFO L93 Difference]: Finished difference Result 6073 states and 13449 transitions. [2019-11-15 20:41:45,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:41:45,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 20:41:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:45,021 INFO L225 Difference]: With dead ends: 6073 [2019-11-15 20:41:45,021 INFO L226 Difference]: Without dead ends: 6073 [2019-11-15 20:41:45,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:41:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2019-11-15 20:41:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 5218. [2019-11-15 20:41:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-11-15 20:41:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 11591 transitions. [2019-11-15 20:41:45,078 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 11591 transitions. Word has length 93 [2019-11-15 20:41:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:45,079 INFO L462 AbstractCegarLoop]: Abstraction has 5218 states and 11591 transitions. [2019-11-15 20:41:45,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:41:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 11591 transitions. [2019-11-15 20:41:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:41:45,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:45,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:45,085 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1223592850, now seen corresponding path program 1 times [2019-11-15 20:41:45,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:45,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455274255] [2019-11-15 20:41:45,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:45,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:45,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:45,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455274255] [2019-11-15 20:41:45,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:45,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:41:45,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635944520] [2019-11-15 20:41:45,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:41:45,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:45,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:41:45,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:45,158 INFO L87 Difference]: Start difference. First operand 5218 states and 11591 transitions. Second operand 4 states. [2019-11-15 20:41:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:45,292 INFO L93 Difference]: Finished difference Result 6168 states and 13617 transitions. [2019-11-15 20:41:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:41:45,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-15 20:41:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:45,300 INFO L225 Difference]: With dead ends: 6168 [2019-11-15 20:41:45,300 INFO L226 Difference]: Without dead ends: 6168 [2019-11-15 20:41:45,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2019-11-15 20:41:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 5399. [2019-11-15 20:41:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5399 states. [2019-11-15 20:41:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 11983 transitions. [2019-11-15 20:41:45,361 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 11983 transitions. Word has length 93 [2019-11-15 20:41:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:45,361 INFO L462 AbstractCegarLoop]: Abstraction has 5399 states and 11983 transitions. [2019-11-15 20:41:45,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:41:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 11983 transitions. [2019-11-15 20:41:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:45,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:45,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:45,366 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1124904383, now seen corresponding path program 1 times [2019-11-15 20:41:45,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:45,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634765890] [2019-11-15 20:41:45,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:45,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:45,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:45,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634765890] [2019-11-15 20:41:45,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:45,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:41:45,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870689910] [2019-11-15 20:41:45,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:41:45,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:41:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:45,434 INFO L87 Difference]: Start difference. First operand 5399 states and 11983 transitions. Second operand 4 states. [2019-11-15 20:41:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:45,551 INFO L93 Difference]: Finished difference Result 5830 states and 12950 transitions. [2019-11-15 20:41:45,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:41:45,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 20:41:45,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:45,556 INFO L225 Difference]: With dead ends: 5830 [2019-11-15 20:41:45,556 INFO L226 Difference]: Without dead ends: 5830 [2019-11-15 20:41:45,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5830 states. [2019-11-15 20:41:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5830 to 5470. [2019-11-15 20:41:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-11-15 20:41:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 12134 transitions. [2019-11-15 20:41:45,614 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 12134 transitions. Word has length 95 [2019-11-15 20:41:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:45,615 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 12134 transitions. [2019-11-15 20:41:45,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:41:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 12134 transitions. [2019-11-15 20:41:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:45,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:45,622 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:45,623 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash -24926304, now seen corresponding path program 1 times [2019-11-15 20:41:45,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:45,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530714357] [2019-11-15 20:41:45,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:45,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:45,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:45,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530714357] [2019-11-15 20:41:45,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:45,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:41:45,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337018890] [2019-11-15 20:41:45,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:41:45,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:45,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:41:45,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:41:45,701 INFO L87 Difference]: Start difference. First operand 5470 states and 12134 transitions. Second operand 4 states. [2019-11-15 20:41:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:46,094 INFO L93 Difference]: Finished difference Result 6781 states and 14963 transitions. [2019-11-15 20:41:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:41:46,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 20:41:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:46,103 INFO L225 Difference]: With dead ends: 6781 [2019-11-15 20:41:46,104 INFO L226 Difference]: Without dead ends: 6729 [2019-11-15 20:41:46,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:41:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6729 states. [2019-11-15 20:41:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6729 to 6426. [2019-11-15 20:41:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6426 states. [2019-11-15 20:41:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6426 states to 6426 states and 14205 transitions. [2019-11-15 20:41:46,256 INFO L78 Accepts]: Start accepts. Automaton has 6426 states and 14205 transitions. Word has length 95 [2019-11-15 20:41:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:46,257 INFO L462 AbstractCegarLoop]: Abstraction has 6426 states and 14205 transitions. [2019-11-15 20:41:46,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:41:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6426 states and 14205 transitions. [2019-11-15 20:41:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:46,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:46,265 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:46,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1092853570, now seen corresponding path program 1 times [2019-11-15 20:41:46,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:46,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031943491] [2019-11-15 20:41:46,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:46,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:46,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:46,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031943491] [2019-11-15 20:41:46,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:46,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:46,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733993227] [2019-11-15 20:41:46,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:46,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:46,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:46,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:46,361 INFO L87 Difference]: Start difference. First operand 6426 states and 14205 transitions. Second operand 6 states. [2019-11-15 20:41:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:46,880 INFO L93 Difference]: Finished difference Result 7746 states and 17039 transitions. [2019-11-15 20:41:46,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:41:46,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:41:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:46,890 INFO L225 Difference]: With dead ends: 7746 [2019-11-15 20:41:46,890 INFO L226 Difference]: Without dead ends: 7746 [2019-11-15 20:41:46,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:41:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2019-11-15 20:41:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 7326. [2019-11-15 20:41:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-11-15 20:41:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 16160 transitions. [2019-11-15 20:41:46,975 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 16160 transitions. Word has length 95 [2019-11-15 20:41:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:46,975 INFO L462 AbstractCegarLoop]: Abstraction has 7326 states and 16160 transitions. [2019-11-15 20:41:46,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 16160 transitions. [2019-11-15 20:41:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:46,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:46,982 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2102135647, now seen corresponding path program 1 times [2019-11-15 20:41:46,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:46,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935759281] [2019-11-15 20:41:46,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:46,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:46,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:47,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935759281] [2019-11-15 20:41:47,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:47,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:41:47,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782755283] [2019-11-15 20:41:47,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:41:47,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:47,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:41:47,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:41:47,175 INFO L87 Difference]: Start difference. First operand 7326 states and 16160 transitions. Second operand 10 states. [2019-11-15 20:41:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:47,960 INFO L93 Difference]: Finished difference Result 8472 states and 18500 transitions. [2019-11-15 20:41:47,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:41:47,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 20:41:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:47,968 INFO L225 Difference]: With dead ends: 8472 [2019-11-15 20:41:47,968 INFO L226 Difference]: Without dead ends: 8472 [2019-11-15 20:41:47,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:41:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2019-11-15 20:41:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 7567. [2019-11-15 20:41:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7567 states. [2019-11-15 20:41:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7567 states to 7567 states and 16665 transitions. [2019-11-15 20:41:48,052 INFO L78 Accepts]: Start accepts. Automaton has 7567 states and 16665 transitions. Word has length 95 [2019-11-15 20:41:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:48,052 INFO L462 AbstractCegarLoop]: Abstraction has 7567 states and 16665 transitions. [2019-11-15 20:41:48,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:41:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7567 states and 16665 transitions. [2019-11-15 20:41:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:48,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:48,059 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:48,059 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1890784734, now seen corresponding path program 1 times [2019-11-15 20:41:48,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:48,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508881966] [2019-11-15 20:41:48,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:48,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:48,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:48,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508881966] [2019-11-15 20:41:48,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:48,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:41:48,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515261173] [2019-11-15 20:41:48,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:41:48,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:48,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:41:48,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:41:48,269 INFO L87 Difference]: Start difference. First operand 7567 states and 16665 transitions. Second operand 9 states. [2019-11-15 20:41:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:48,939 INFO L93 Difference]: Finished difference Result 9037 states and 19740 transitions. [2019-11-15 20:41:48,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:41:48,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 20:41:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:48,951 INFO L225 Difference]: With dead ends: 9037 [2019-11-15 20:41:48,951 INFO L226 Difference]: Without dead ends: 8998 [2019-11-15 20:41:48,951 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 20:41:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2019-11-15 20:41:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 6730. [2019-11-15 20:41:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6730 states. [2019-11-15 20:41:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 14798 transitions. [2019-11-15 20:41:49,074 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 14798 transitions. Word has length 95 [2019-11-15 20:41:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:49,075 INFO L462 AbstractCegarLoop]: Abstraction has 6730 states and 14798 transitions. [2019-11-15 20:41:49,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:41:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 14798 transitions. [2019-11-15 20:41:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:49,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:49,084 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:49,084 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:49,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1003281053, now seen corresponding path program 1 times [2019-11-15 20:41:49,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:49,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154410729] [2019-11-15 20:41:49,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:49,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:49,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:49,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154410729] [2019-11-15 20:41:49,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:49,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:41:49,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573876651] [2019-11-15 20:41:49,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:41:49,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:49,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:41:49,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:41:49,274 INFO L87 Difference]: Start difference. First operand 6730 states and 14798 transitions. Second operand 10 states. [2019-11-15 20:41:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:49,925 INFO L93 Difference]: Finished difference Result 20274 states and 45174 transitions. [2019-11-15 20:41:49,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 20:41:49,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 20:41:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:49,943 INFO L225 Difference]: With dead ends: 20274 [2019-11-15 20:41:49,943 INFO L226 Difference]: Without dead ends: 13408 [2019-11-15 20:41:49,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:41:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13408 states. [2019-11-15 20:41:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13408 to 6725. [2019-11-15 20:41:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6725 states. [2019-11-15 20:41:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6725 states to 6725 states and 14709 transitions. [2019-11-15 20:41:50,093 INFO L78 Accepts]: Start accepts. Automaton has 6725 states and 14709 transitions. Word has length 95 [2019-11-15 20:41:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:50,093 INFO L462 AbstractCegarLoop]: Abstraction has 6725 states and 14709 transitions. [2019-11-15 20:41:50,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:41:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6725 states and 14709 transitions. [2019-11-15 20:41:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:50,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:50,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:50,102 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 662442241, now seen corresponding path program 1 times [2019-11-15 20:41:50,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:50,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37854012] [2019-11-15 20:41:50,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:50,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:50,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:50,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37854012] [2019-11-15 20:41:50,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:50,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:50,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970172895] [2019-11-15 20:41:50,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:50,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:50,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:50,240 INFO L87 Difference]: Start difference. First operand 6725 states and 14709 transitions. Second operand 6 states. [2019-11-15 20:41:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:50,546 INFO L93 Difference]: Finished difference Result 7545 states and 16406 transitions. [2019-11-15 20:41:50,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:41:50,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:41:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:50,558 INFO L225 Difference]: With dead ends: 7545 [2019-11-15 20:41:50,558 INFO L226 Difference]: Without dead ends: 7507 [2019-11-15 20:41:50,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:41:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7507 states. [2019-11-15 20:41:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7507 to 6632. [2019-11-15 20:41:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6632 states. [2019-11-15 20:41:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 14451 transitions. [2019-11-15 20:41:50,665 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 14451 transitions. Word has length 95 [2019-11-15 20:41:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:50,665 INFO L462 AbstractCegarLoop]: Abstraction has 6632 states and 14451 transitions. [2019-11-15 20:41:50,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 14451 transitions. [2019-11-15 20:41:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:50,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:50,674 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:50,675 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:50,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1730453569, now seen corresponding path program 2 times [2019-11-15 20:41:50,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:50,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918574334] [2019-11-15 20:41:50,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:50,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:50,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:50,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918574334] [2019-11-15 20:41:50,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:50,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:41:50,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388237092] [2019-11-15 20:41:50,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:41:50,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:41:50,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:41:50,898 INFO L87 Difference]: Start difference. First operand 6632 states and 14451 transitions. Second operand 10 states. [2019-11-15 20:41:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:51,775 INFO L93 Difference]: Finished difference Result 7306 states and 15873 transitions. [2019-11-15 20:41:51,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:41:51,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 20:41:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:51,785 INFO L225 Difference]: With dead ends: 7306 [2019-11-15 20:41:51,785 INFO L226 Difference]: Without dead ends: 7300 [2019-11-15 20:41:51,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:41:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7300 states. [2019-11-15 20:41:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7300 to 6795. [2019-11-15 20:41:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6795 states. [2019-11-15 20:41:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6795 states to 6795 states and 14813 transitions. [2019-11-15 20:41:51,894 INFO L78 Accepts]: Start accepts. Automaton has 6795 states and 14813 transitions. Word has length 95 [2019-11-15 20:41:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:51,894 INFO L462 AbstractCegarLoop]: Abstraction has 6795 states and 14813 transitions. [2019-11-15 20:41:51,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:41:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 6795 states and 14813 transitions. [2019-11-15 20:41:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:51,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:51,904 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:51,904 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1941804482, now seen corresponding path program 1 times [2019-11-15 20:41:51,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:51,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554589803] [2019-11-15 20:41:51,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:51,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:51,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:52,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554589803] [2019-11-15 20:41:52,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:52,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:41:52,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254555525] [2019-11-15 20:41:52,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:41:52,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:52,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:41:52,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:41:52,013 INFO L87 Difference]: Start difference. First operand 6795 states and 14813 transitions. Second operand 7 states. [2019-11-15 20:41:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:52,469 INFO L93 Difference]: Finished difference Result 6665 states and 14497 transitions. [2019-11-15 20:41:52,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:41:52,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 20:41:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:52,478 INFO L225 Difference]: With dead ends: 6665 [2019-11-15 20:41:52,478 INFO L226 Difference]: Without dead ends: 6665 [2019-11-15 20:41:52,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:41:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2019-11-15 20:41:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6463. [2019-11-15 20:41:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6463 states. [2019-11-15 20:41:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6463 states to 6463 states and 14077 transitions. [2019-11-15 20:41:52,582 INFO L78 Accepts]: Start accepts. Automaton has 6463 states and 14077 transitions. Word has length 95 [2019-11-15 20:41:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:52,582 INFO L462 AbstractCegarLoop]: Abstraction has 6463 states and 14077 transitions. [2019-11-15 20:41:52,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:41:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6463 states and 14077 transitions. [2019-11-15 20:41:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:52,590 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:52,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:52,591 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:52,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2015328478, now seen corresponding path program 1 times [2019-11-15 20:41:52,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:52,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803957626] [2019-11-15 20:41:52,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:52,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:52,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:52,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803957626] [2019-11-15 20:41:52,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:52,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:41:52,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891146764] [2019-11-15 20:41:52,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:41:52,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:52,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:41:52,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:41:52,711 INFO L87 Difference]: Start difference. First operand 6463 states and 14077 transitions. Second operand 6 states. [2019-11-15 20:41:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:53,208 INFO L93 Difference]: Finished difference Result 8088 states and 17627 transitions. [2019-11-15 20:41:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:41:53,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:41:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:53,217 INFO L225 Difference]: With dead ends: 8088 [2019-11-15 20:41:53,217 INFO L226 Difference]: Without dead ends: 8088 [2019-11-15 20:41:53,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:41:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8088 states. [2019-11-15 20:41:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8088 to 6330. [2019-11-15 20:41:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6330 states. [2019-11-15 20:41:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6330 states to 6330 states and 13757 transitions. [2019-11-15 20:41:53,323 INFO L78 Accepts]: Start accepts. Automaton has 6330 states and 13757 transitions. Word has length 95 [2019-11-15 20:41:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:53,324 INFO L462 AbstractCegarLoop]: Abstraction has 6330 states and 13757 transitions. [2019-11-15 20:41:53,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:41:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6330 states and 13757 transitions. [2019-11-15 20:41:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:53,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:53,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:53,333 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:53,334 INFO L82 PathProgramCache]: Analyzing trace with hash 213745602, now seen corresponding path program 1 times [2019-11-15 20:41:53,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:53,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647022836] [2019-11-15 20:41:53,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:53,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:53,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:53,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647022836] [2019-11-15 20:41:53,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:41:53,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:41:53,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730771230] [2019-11-15 20:41:53,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:41:53,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:41:53,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:41:53,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:41:53,540 INFO L87 Difference]: Start difference. First operand 6330 states and 13757 transitions. Second operand 9 states. [2019-11-15 20:41:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:41:54,457 INFO L93 Difference]: Finished difference Result 7077 states and 15185 transitions. [2019-11-15 20:41:54,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:41:54,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 20:41:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:41:54,466 INFO L225 Difference]: With dead ends: 7077 [2019-11-15 20:41:54,466 INFO L226 Difference]: Without dead ends: 7065 [2019-11-15 20:41:54,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:41:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7065 states. [2019-11-15 20:41:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7065 to 5809. [2019-11-15 20:41:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5809 states. [2019-11-15 20:41:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 12568 transitions. [2019-11-15 20:41:54,556 INFO L78 Accepts]: Start accepts. Automaton has 5809 states and 12568 transitions. Word has length 95 [2019-11-15 20:41:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:41:54,557 INFO L462 AbstractCegarLoop]: Abstraction has 5809 states and 12568 transitions. [2019-11-15 20:41:54,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:41:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5809 states and 12568 transitions. [2019-11-15 20:41:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:41:54,564 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:41:54,564 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:41:54,564 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:41:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash 425096515, now seen corresponding path program 2 times [2019-11-15 20:41:54,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:41:54,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686518022] [2019-11-15 20:41:54,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:54,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:41:54,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:41:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:41:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:41:54,677 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:41:54,677 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:41:54,871 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:41:54,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:41:54 BasicIcfg [2019-11-15 20:41:54,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:41:54,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:41:54,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:41:54,876 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:41:54,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:41:04" (3/4) ... [2019-11-15 20:41:54,879 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:41:55,078 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_23de26b8-c716-47a0-abf1-197077734870/bin/uautomizer/witness.graphml [2019-11-15 20:41:55,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:41:55,081 INFO L168 Benchmark]: Toolchain (without parser) took 52439.89 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 939.4 MB in the beginning and 1.6 GB in the end (delta: -691.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 20:41:55,081 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:41:55,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:41:55,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:41:55,082 INFO L168 Benchmark]: Boogie Preprocessor took 47.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:41:55,083 INFO L168 Benchmark]: RCFGBuilder took 1014.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:41:55,083 INFO L168 Benchmark]: TraceAbstraction took 50274.13 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -638.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 20:41:55,084 INFO L168 Benchmark]: Witness Printer took 203.64 ms. Allocated memory is still 4.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 70.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:41:55,085 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 834.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1014.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50274.13 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -638.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 203.64 ms. Allocated memory is still 4.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 70.9 MB). Peak memory consumption was 70.9 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L793] 0 pthread_t t1547; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L794] FCALL, FORK 0 pthread_create(&t1547, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L795] 0 pthread_t t1548; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L796] FCALL, FORK 0 pthread_create(&t1548, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L759] 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_p0_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, 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 = 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)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, 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 = 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)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, 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$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)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_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)) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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_p0_EAX=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$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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$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)) [L765] 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_p0_EAX=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$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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=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] [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=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] [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=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] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=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] [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 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 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 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 [L809] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 50.1s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10096 SDtfs, 11413 SDslu, 25883 SDs, 0 SdLazy, 10317 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 103 SyntacticMatches, 33 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred 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: 16.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 111690 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2474 ConstructedInterpolants, 0 QuantifiedInterpolants, 523264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...