./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/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 5c964dccc71ffd31c2fec41a5c718dc8945a2965 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-16 00:21:47,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:21:47,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:21:47,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:21:47,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:21:47,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:21:47,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:21:47,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:21:47,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:21:47,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:21:47,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:21:47,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:21:47,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:21:47,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:21:47,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:21:47,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:21:47,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:21:47,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:21:47,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:21:47,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:21:47,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:21:47,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:21:47,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:21:47,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:21:47,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:21:47,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:21:47,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:21:47,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:21:47,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:21:47,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:21:47,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:21:47,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:21:47,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:21:47,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:21:47,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:21:47,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:21:47,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:21:47,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:21:47,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:21:47,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:21:47,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:21:47,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:21:47,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:21:47,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:21:47,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:21:47,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:21:47,737 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:21:47,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:21:47,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:21:47,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:21:47,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:21:47,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:21:47,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:21:47,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:21:47,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:21:47,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:21:47,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:21:47,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:21:47,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:21:47,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:21:47,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:21:47,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:21:47,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:21:47,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:21:47,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:21:47,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:21:47,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:21:47,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:21:47,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:21:47,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:21:47,743 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_cbe0da84-6c19-4172-be8b-2fbf2dea3809/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 -> 5c964dccc71ffd31c2fec41a5c718dc8945a2965 [2019-11-16 00:21:47,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:21:47,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:21:47,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:21:47,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:21:47,795 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:21:47,795 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i [2019-11-16 00:21:47,852 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/data/b5b9af406/2a8cd8cf93be48e99f1533261c7b63b8/FLAG0234cb078 [2019-11-16 00:21:48,336 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:21:48,336 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/sv-benchmarks/c/pthread-wmm/safe010_pso.oepc.i [2019-11-16 00:21:48,354 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/data/b5b9af406/2a8cd8cf93be48e99f1533261c7b63b8/FLAG0234cb078 [2019-11-16 00:21:48,686 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/data/b5b9af406/2a8cd8cf93be48e99f1533261c7b63b8 [2019-11-16 00:21:48,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:21:48,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:21:48,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:48,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:21:48,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:21:48,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:48" (1/1) ... [2019-11-16 00:21:48,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709cc48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:48, skipping insertion in model container [2019-11-16 00:21:48,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:48" (1/1) ... [2019-11-16 00:21:48,704 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:21:48,757 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:21:49,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:49,221 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:21:49,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:49,366 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:21:49,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49 WrapperNode [2019-11-16 00:21:49,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:49,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:49,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:21:49,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:21:49,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:49,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:21:49,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:21:49,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:21:49,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... [2019-11-16 00:21:49,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:21:49,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:21:49,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:21:49,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:21:49,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/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-16 00:21:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:21:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:21:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:21:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:21:49,534 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:21:49,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:21:49,534 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:21:49,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:21:49,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:21:49,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:21:49,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:21:49,539 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:21:50,272 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:21:50,273 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:21:50,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:50 BoogieIcfgContainer [2019-11-16 00:21:50,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:21:50,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:21:50,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:21:50,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:21:50,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:21:48" (1/3) ... [2019-11-16 00:21:50,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9d6b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:50, skipping insertion in model container [2019-11-16 00:21:50,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:49" (2/3) ... [2019-11-16 00:21:50,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9d6b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:50, skipping insertion in model container [2019-11-16 00:21:50,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:50" (3/3) ... [2019-11-16 00:21:50,280 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2019-11-16 00:21:50,315 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,315 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,315 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,315 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,316 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,316 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,316 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,321 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,321 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,321 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,321 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,321 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,322 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,322 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,322 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,323 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,323 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:21:50,333 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:21:50,334 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:21:50,340 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:21:50,350 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:21:50,384 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:21:50,384 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:21:50,385 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:21:50,385 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:21:50,385 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:21:50,385 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:21:50,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:21:50,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:21:50,398 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 177 transitions [2019-11-16 00:21:51,900 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22509 states. [2019-11-16 00:21:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 22509 states. [2019-11-16 00:21:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:21:51,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:51,912 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:51,916 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:51,921 INFO L82 PathProgramCache]: Analyzing trace with hash 733594359, now seen corresponding path program 1 times [2019-11-16 00:21:51,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:51,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960767867] [2019-11-16 00:21:51,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:52,190 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-16 00:21:52,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960767867] [2019-11-16 00:21:52,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:52,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:21:52,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919208052] [2019-11-16 00:21:52,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:21:52,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:21:52,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:21:52,212 INFO L87 Difference]: Start difference. First operand 22509 states. Second operand 4 states. [2019-11-16 00:21:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:52,845 INFO L93 Difference]: Finished difference Result 23453 states and 91770 transitions. [2019-11-16 00:21:52,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:21:52,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-16 00:21:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:53,047 INFO L225 Difference]: With dead ends: 23453 [2019-11-16 00:21:53,047 INFO L226 Difference]: Without dead ends: 21277 [2019-11-16 00:21:53,049 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-16 00:21:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21277 states. [2019-11-16 00:21:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21277 to 21277. [2019-11-16 00:21:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21277 states. [2019-11-16 00:21:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 83794 transitions. [2019-11-16 00:21:54,225 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 83794 transitions. Word has length 32 [2019-11-16 00:21:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:54,226 INFO L462 AbstractCegarLoop]: Abstraction has 21277 states and 83794 transitions. [2019-11-16 00:21:54,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:21:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 83794 transitions. [2019-11-16 00:21:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:21:54,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:54,238 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] [2019-11-16 00:21:54,238 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1574494247, now seen corresponding path program 1 times [2019-11-16 00:21:54,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:54,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83634037] [2019-11-16 00:21:54,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:54,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:54,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:54,408 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-16 00:21:54,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83634037] [2019-11-16 00:21:54,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:54,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:21:54,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505426307] [2019-11-16 00:21:54,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:21:54,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:54,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:21:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:21:54,411 INFO L87 Difference]: Start difference. First operand 21277 states and 83794 transitions. Second operand 5 states. [2019-11-16 00:21:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:55,389 INFO L93 Difference]: Finished difference Result 34711 states and 129090 transitions. [2019-11-16 00:21:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:21:55,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-16 00:21:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:55,526 INFO L225 Difference]: With dead ends: 34711 [2019-11-16 00:21:55,526 INFO L226 Difference]: Without dead ends: 34567 [2019-11-16 00:21:55,527 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-16 00:21:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-11-16 00:21:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 33067. [2019-11-16 00:21:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33067 states. [2019-11-16 00:21:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33067 states to 33067 states and 123978 transitions. [2019-11-16 00:21:56,802 INFO L78 Accepts]: Start accepts. Automaton has 33067 states and 123978 transitions. Word has length 43 [2019-11-16 00:21:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:56,804 INFO L462 AbstractCegarLoop]: Abstraction has 33067 states and 123978 transitions. [2019-11-16 00:21:56,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:21:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 33067 states and 123978 transitions. [2019-11-16 00:21:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:21:56,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:56,808 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:56,809 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash -606075449, now seen corresponding path program 1 times [2019-11-16 00:21:56,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:56,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103846554] [2019-11-16 00:21:56,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:56,891 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-16 00:21:56,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103846554] [2019-11-16 00:21:56,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:56,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:21:56,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9181519] [2019-11-16 00:21:56,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:21:56,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:56,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:21:56,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:21:56,893 INFO L87 Difference]: Start difference. First operand 33067 states and 123978 transitions. Second operand 5 states. [2019-11-16 00:21:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:57,957 INFO L93 Difference]: Finished difference Result 40219 states and 148647 transitions. [2019-11-16 00:21:57,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:21:57,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-16 00:21:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:58,222 INFO L225 Difference]: With dead ends: 40219 [2019-11-16 00:21:58,222 INFO L226 Difference]: Without dead ends: 40059 [2019-11-16 00:21:58,223 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-16 00:21:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40059 states. [2019-11-16 00:21:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40059 to 34640. [2019-11-16 00:21:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34640 states. [2019-11-16 00:21:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34640 states to 34640 states and 129274 transitions. [2019-11-16 00:21:59,732 INFO L78 Accepts]: Start accepts. Automaton has 34640 states and 129274 transitions. Word has length 44 [2019-11-16 00:21:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:59,733 INFO L462 AbstractCegarLoop]: Abstraction has 34640 states and 129274 transitions. [2019-11-16 00:21:59,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:21:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 34640 states and 129274 transitions. [2019-11-16 00:21:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:21:59,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:59,745 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:59,745 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -748529186, now seen corresponding path program 1 times [2019-11-16 00:21:59,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:59,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869389922] [2019-11-16 00:21:59,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:59,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:59,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:59,851 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-16 00:21:59,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869389922] [2019-11-16 00:21:59,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:59,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:21:59,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238395873] [2019-11-16 00:21:59,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:21:59,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:59,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:21:59,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:21:59,853 INFO L87 Difference]: Start difference. First operand 34640 states and 129274 transitions. Second operand 6 states. [2019-11-16 00:22:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:00,870 INFO L93 Difference]: Finished difference Result 45668 states and 166168 transitions. [2019-11-16 00:22:00,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:22:00,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:22:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:00,979 INFO L225 Difference]: With dead ends: 45668 [2019-11-16 00:22:00,979 INFO L226 Difference]: Without dead ends: 45524 [2019-11-16 00:22:00,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:22:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45524 states. [2019-11-16 00:22:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45524 to 33603. [2019-11-16 00:22:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33603 states. [2019-11-16 00:22:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33603 states to 33603 states and 125429 transitions. [2019-11-16 00:22:02,464 INFO L78 Accepts]: Start accepts. Automaton has 33603 states and 125429 transitions. Word has length 51 [2019-11-16 00:22:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:02,464 INFO L462 AbstractCegarLoop]: Abstraction has 33603 states and 125429 transitions. [2019-11-16 00:22:02,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:22:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 33603 states and 125429 transitions. [2019-11-16 00:22:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:22:02,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:02,496 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] [2019-11-16 00:22:02,497 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:02,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1972912513, now seen corresponding path program 1 times [2019-11-16 00:22:02,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:02,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615607741] [2019-11-16 00:22:02,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:02,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:02,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:02,648 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-16 00:22:02,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615607741] [2019-11-16 00:22:02,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:02,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:22:02,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288282504] [2019-11-16 00:22:02,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:22:02,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:02,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:22:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:02,650 INFO L87 Difference]: Start difference. First operand 33603 states and 125429 transitions. Second operand 6 states. [2019-11-16 00:22:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:03,359 INFO L93 Difference]: Finished difference Result 46075 states and 167862 transitions. [2019-11-16 00:22:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:22:03,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-16 00:22:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:03,434 INFO L225 Difference]: With dead ends: 46075 [2019-11-16 00:22:03,434 INFO L226 Difference]: Without dead ends: 45835 [2019-11-16 00:22:03,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:22:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45835 states. [2019-11-16 00:22:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45835 to 39964. [2019-11-16 00:22:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39964 states. [2019-11-16 00:22:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39964 states to 39964 states and 147353 transitions. [2019-11-16 00:22:04,661 INFO L78 Accepts]: Start accepts. Automaton has 39964 states and 147353 transitions. Word has length 58 [2019-11-16 00:22:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:04,661 INFO L462 AbstractCegarLoop]: Abstraction has 39964 states and 147353 transitions. [2019-11-16 00:22:04,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:22:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 39964 states and 147353 transitions. [2019-11-16 00:22:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:22:04,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:04,693 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-16 00:22:04,693 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash -207346572, now seen corresponding path program 1 times [2019-11-16 00:22:04,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:04,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969073106] [2019-11-16 00:22:04,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:04,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:04,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:04,770 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-16 00:22:04,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969073106] [2019-11-16 00:22:04,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:04,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:04,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349445937] [2019-11-16 00:22:04,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:04,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:04,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:04,775 INFO L87 Difference]: Start difference. First operand 39964 states and 147353 transitions. Second operand 3 states. [2019-11-16 00:22:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:04,988 INFO L93 Difference]: Finished difference Result 50262 states and 182188 transitions. [2019-11-16 00:22:04,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:04,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-16 00:22:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:05,080 INFO L225 Difference]: With dead ends: 50262 [2019-11-16 00:22:05,080 INFO L226 Difference]: Without dead ends: 50262 [2019-11-16 00:22:05,081 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-16 00:22:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50262 states. [2019-11-16 00:22:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50262 to 43894. [2019-11-16 00:22:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43894 states. [2019-11-16 00:22:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43894 states to 43894 states and 160791 transitions. [2019-11-16 00:22:05,803 INFO L78 Accepts]: Start accepts. Automaton has 43894 states and 160791 transitions. Word has length 60 [2019-11-16 00:22:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:05,804 INFO L462 AbstractCegarLoop]: Abstraction has 43894 states and 160791 transitions. [2019-11-16 00:22:05,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 43894 states and 160791 transitions. [2019-11-16 00:22:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:22:05,835 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:05,835 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:05,835 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:05,835 INFO L82 PathProgramCache]: Analyzing trace with hash 280232242, now seen corresponding path program 1 times [2019-11-16 00:22:05,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:05,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775863035] [2019-11-16 00:22:05,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:05,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:05,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:05,930 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-16 00:22:05,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775863035] [2019-11-16 00:22:05,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:05,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:22:05,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697189370] [2019-11-16 00:22:05,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:05,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:05,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:05,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:05,932 INFO L87 Difference]: Start difference. First operand 43894 states and 160791 transitions. Second operand 7 states. [2019-11-16 00:22:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:06,975 INFO L93 Difference]: Finished difference Result 55890 states and 200525 transitions. [2019-11-16 00:22:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:22:06,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-16 00:22:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:07,077 INFO L225 Difference]: With dead ends: 55890 [2019-11-16 00:22:07,077 INFO L226 Difference]: Without dead ends: 55650 [2019-11-16 00:22:07,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:22:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55650 states. [2019-11-16 00:22:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55650 to 45120. [2019-11-16 00:22:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45120 states. [2019-11-16 00:22:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45120 states to 45120 states and 164958 transitions. [2019-11-16 00:22:08,196 INFO L78 Accepts]: Start accepts. Automaton has 45120 states and 164958 transitions. Word has length 64 [2019-11-16 00:22:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:08,196 INFO L462 AbstractCegarLoop]: Abstraction has 45120 states and 164958 transitions. [2019-11-16 00:22:08,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 45120 states and 164958 transitions. [2019-11-16 00:22:08,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:22:08,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:08,229 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:08,229 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:08,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1278104470, now seen corresponding path program 1 times [2019-11-16 00:22:08,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:08,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366583144] [2019-11-16 00:22:08,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:08,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:08,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:08,283 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-16 00:22:08,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366583144] [2019-11-16 00:22:08,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:08,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:22:08,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606734248] [2019-11-16 00:22:08,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:22:08,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:08,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:22:08,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:22:08,285 INFO L87 Difference]: Start difference. First operand 45120 states and 164958 transitions. Second operand 5 states. [2019-11-16 00:22:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:09,576 INFO L93 Difference]: Finished difference Result 115002 states and 419394 transitions. [2019-11-16 00:22:09,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:22:09,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:22:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:09,811 INFO L225 Difference]: With dead ends: 115002 [2019-11-16 00:22:09,811 INFO L226 Difference]: Without dead ends: 114262 [2019-11-16 00:22:09,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:22:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114262 states. [2019-11-16 00:22:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114262 to 64599. [2019-11-16 00:22:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64599 states. [2019-11-16 00:22:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64599 states to 64599 states and 236588 transitions. [2019-11-16 00:22:11,692 INFO L78 Accepts]: Start accepts. Automaton has 64599 states and 236588 transitions. Word has length 65 [2019-11-16 00:22:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:11,692 INFO L462 AbstractCegarLoop]: Abstraction has 64599 states and 236588 transitions. [2019-11-16 00:22:11,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:22:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 64599 states and 236588 transitions. [2019-11-16 00:22:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:22:11,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:11,737 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:11,737 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 914987415, now seen corresponding path program 1 times [2019-11-16 00:22:11,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:11,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027043433] [2019-11-16 00:22:11,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:11,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:11,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:11,830 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-16 00:22:11,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027043433] [2019-11-16 00:22:11,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:11,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:22:11,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403346311] [2019-11-16 00:22:11,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:22:11,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:22:11,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:11,832 INFO L87 Difference]: Start difference. First operand 64599 states and 236588 transitions. Second operand 6 states. [2019-11-16 00:22:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:12,438 INFO L93 Difference]: Finished difference Result 71048 states and 257943 transitions. [2019-11-16 00:22:12,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:22:12,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:22:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:12,581 INFO L225 Difference]: With dead ends: 71048 [2019-11-16 00:22:12,581 INFO L226 Difference]: Without dead ends: 71048 [2019-11-16 00:22:12,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:22:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71048 states. [2019-11-16 00:22:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71048 to 65451. [2019-11-16 00:22:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65451 states. [2019-11-16 00:22:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65451 states to 65451 states and 239375 transitions. [2019-11-16 00:22:14,260 INFO L78 Accepts]: Start accepts. Automaton has 65451 states and 239375 transitions. Word has length 65 [2019-11-16 00:22:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:14,260 INFO L462 AbstractCegarLoop]: Abstraction has 65451 states and 239375 transitions. [2019-11-16 00:22:14,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:22:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 65451 states and 239375 transitions. [2019-11-16 00:22:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:22:14,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:14,323 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:14,323 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1452202216, now seen corresponding path program 1 times [2019-11-16 00:22:14,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:14,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394165651] [2019-11-16 00:22:14,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:14,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:14,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:14,433 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-16 00:22:14,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394165651] [2019-11-16 00:22:14,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:14,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:22:14,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951538510] [2019-11-16 00:22:14,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:14,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:14,436 INFO L87 Difference]: Start difference. First operand 65451 states and 239375 transitions. Second operand 7 states. [2019-11-16 00:22:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:15,586 INFO L93 Difference]: Finished difference Result 75675 states and 272886 transitions. [2019-11-16 00:22:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:22:15,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-16 00:22:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:15,734 INFO L225 Difference]: With dead ends: 75675 [2019-11-16 00:22:15,734 INFO L226 Difference]: Without dead ends: 75475 [2019-11-16 00:22:15,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:22:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75475 states. [2019-11-16 00:22:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75475 to 66329. [2019-11-16 00:22:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66329 states. [2019-11-16 00:22:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66329 states to 66329 states and 242246 transitions. [2019-11-16 00:22:16,855 INFO L78 Accepts]: Start accepts. Automaton has 66329 states and 242246 transitions. Word has length 65 [2019-11-16 00:22:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:16,856 INFO L462 AbstractCegarLoop]: Abstraction has 66329 states and 242246 transitions. [2019-11-16 00:22:16,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 66329 states and 242246 transitions. [2019-11-16 00:22:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:22:16,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:16,906 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:16,907 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash -712788728, now seen corresponding path program 1 times [2019-11-16 00:22:16,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:16,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305036072] [2019-11-16 00:22:16,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:16,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:16,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:16,968 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-16 00:22:16,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305036072] [2019-11-16 00:22:16,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:16,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:16,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947418657] [2019-11-16 00:22:16,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:16,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:16,971 INFO L87 Difference]: Start difference. First operand 66329 states and 242246 transitions. Second operand 3 states. [2019-11-16 00:22:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:17,651 INFO L93 Difference]: Finished difference Result 64370 states and 233071 transitions. [2019-11-16 00:22:17,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:17,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-16 00:22:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:17,778 INFO L225 Difference]: With dead ends: 64370 [2019-11-16 00:22:17,779 INFO L226 Difference]: Without dead ends: 64208 [2019-11-16 00:22:17,779 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-16 00:22:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64208 states. [2019-11-16 00:22:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64208 to 64180. [2019-11-16 00:22:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64180 states. [2019-11-16 00:22:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64180 states to 64180 states and 232443 transitions. [2019-11-16 00:22:18,810 INFO L78 Accepts]: Start accepts. Automaton has 64180 states and 232443 transitions. Word has length 67 [2019-11-16 00:22:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:18,810 INFO L462 AbstractCegarLoop]: Abstraction has 64180 states and 232443 transitions. [2019-11-16 00:22:18,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 64180 states and 232443 transitions. [2019-11-16 00:22:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:22:18,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:18,856 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] [2019-11-16 00:22:18,856 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1470674241, now seen corresponding path program 1 times [2019-11-16 00:22:18,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:18,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796371823] [2019-11-16 00:22:18,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:18,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:18,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:18,943 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-16 00:22:18,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796371823] [2019-11-16 00:22:18,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:18,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:22:18,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991304665] [2019-11-16 00:22:18,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:18,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:18,946 INFO L87 Difference]: Start difference. First operand 64180 states and 232443 transitions. Second operand 4 states. [2019-11-16 00:22:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:19,019 INFO L93 Difference]: Finished difference Result 16840 states and 53043 transitions. [2019-11-16 00:22:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:22:19,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:22:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:19,040 INFO L225 Difference]: With dead ends: 16840 [2019-11-16 00:22:19,041 INFO L226 Difference]: Without dead ends: 16137 [2019-11-16 00:22:19,041 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-16 00:22:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2019-11-16 00:22:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 16001. [2019-11-16 00:22:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16001 states. [2019-11-16 00:22:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16001 states to 16001 states and 50461 transitions. [2019-11-16 00:22:19,231 INFO L78 Accepts]: Start accepts. Automaton has 16001 states and 50461 transitions. Word has length 68 [2019-11-16 00:22:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:19,231 INFO L462 AbstractCegarLoop]: Abstraction has 16001 states and 50461 transitions. [2019-11-16 00:22:19,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16001 states and 50461 transitions. [2019-11-16 00:22:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:22:19,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:19,242 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] [2019-11-16 00:22:19,242 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:19,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1982614502, now seen corresponding path program 1 times [2019-11-16 00:22:19,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:19,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527297613] [2019-11-16 00:22:19,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:19,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:19,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:19,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527297613] [2019-11-16 00:22:19,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:19,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:22:19,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123684071] [2019-11-16 00:22:19,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:22:19,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:19,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:22:19,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:22:19,348 INFO L87 Difference]: Start difference. First operand 16001 states and 50461 transitions. Second operand 8 states. [2019-11-16 00:22:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:20,151 INFO L93 Difference]: Finished difference Result 17894 states and 55974 transitions. [2019-11-16 00:22:20,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:22:20,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-11-16 00:22:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:20,175 INFO L225 Difference]: With dead ends: 17894 [2019-11-16 00:22:20,175 INFO L226 Difference]: Without dead ends: 17846 [2019-11-16 00:22:20,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:22:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17846 states. [2019-11-16 00:22:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17846 to 16094. [2019-11-16 00:22:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16094 states. [2019-11-16 00:22:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16094 states to 16094 states and 50886 transitions. [2019-11-16 00:22:20,381 INFO L78 Accepts]: Start accepts. Automaton has 16094 states and 50886 transitions. Word has length 77 [2019-11-16 00:22:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:20,381 INFO L462 AbstractCegarLoop]: Abstraction has 16094 states and 50886 transitions. [2019-11-16 00:22:20,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:22:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 16094 states and 50886 transitions. [2019-11-16 00:22:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:22:20,394 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:20,395 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] [2019-11-16 00:22:20,395 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1564951717, now seen corresponding path program 1 times [2019-11-16 00:22:20,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:20,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096494634] [2019-11-16 00:22:20,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:20,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:20,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:20,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096494634] [2019-11-16 00:22:20,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:20,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:22:20,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905060470] [2019-11-16 00:22:20,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:22:20,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:20,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:22:20,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:20,520 INFO L87 Difference]: Start difference. First operand 16094 states and 50886 transitions. Second operand 6 states. [2019-11-16 00:22:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:21,014 INFO L93 Difference]: Finished difference Result 17857 states and 55827 transitions. [2019-11-16 00:22:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:22:21,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-11-16 00:22:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:21,037 INFO L225 Difference]: With dead ends: 17857 [2019-11-16 00:22:21,038 INFO L226 Difference]: Without dead ends: 17857 [2019-11-16 00:22:21,038 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-16 00:22:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2019-11-16 00:22:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 17110. [2019-11-16 00:22:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17110 states. [2019-11-16 00:22:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17110 states to 17110 states and 53670 transitions. [2019-11-16 00:22:21,243 INFO L78 Accepts]: Start accepts. Automaton has 17110 states and 53670 transitions. Word has length 80 [2019-11-16 00:22:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:21,243 INFO L462 AbstractCegarLoop]: Abstraction has 17110 states and 53670 transitions. [2019-11-16 00:22:21,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:22:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17110 states and 53670 transitions. [2019-11-16 00:22:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:22:21,257 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:21,257 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] [2019-11-16 00:22:21,257 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:21,258 INFO L82 PathProgramCache]: Analyzing trace with hash 794355292, now seen corresponding path program 1 times [2019-11-16 00:22:21,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:21,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830321466] [2019-11-16 00:22:21,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:21,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:21,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:21,370 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-16 00:22:21,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830321466] [2019-11-16 00:22:21,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:21,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:22:21,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955637705] [2019-11-16 00:22:21,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:21,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:21,372 INFO L87 Difference]: Start difference. First operand 17110 states and 53670 transitions. Second operand 7 states. [2019-11-16 00:22:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:21,934 INFO L93 Difference]: Finished difference Result 18508 states and 57510 transitions. [2019-11-16 00:22:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:22:21,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-11-16 00:22:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:21,958 INFO L225 Difference]: With dead ends: 18508 [2019-11-16 00:22:21,958 INFO L226 Difference]: Without dead ends: 18508 [2019-11-16 00:22:21,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:22:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18508 states. [2019-11-16 00:22:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18508 to 17958. [2019-11-16 00:22:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17958 states. [2019-11-16 00:22:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17958 states to 17958 states and 55879 transitions. [2019-11-16 00:22:22,192 INFO L78 Accepts]: Start accepts. Automaton has 17958 states and 55879 transitions. Word has length 80 [2019-11-16 00:22:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:22,192 INFO L462 AbstractCegarLoop]: Abstraction has 17958 states and 55879 transitions. [2019-11-16 00:22:22,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 17958 states and 55879 transitions. [2019-11-16 00:22:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:22:22,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:22,209 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] [2019-11-16 00:22:22,210 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:22,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1124121053, now seen corresponding path program 1 times [2019-11-16 00:22:22,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:22,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114053272] [2019-11-16 00:22:22,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:22,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:22,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:22,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114053272] [2019-11-16 00:22:22,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:22,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:22,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873998831] [2019-11-16 00:22:22,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:22,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:22,265 INFO L87 Difference]: Start difference. First operand 17958 states and 55879 transitions. Second operand 3 states. [2019-11-16 00:22:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:22,345 INFO L93 Difference]: Finished difference Result 16132 states and 49733 transitions. [2019-11-16 00:22:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:22,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-16 00:22:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:22,369 INFO L225 Difference]: With dead ends: 16132 [2019-11-16 00:22:22,370 INFO L226 Difference]: Without dead ends: 16132 [2019-11-16 00:22:22,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16132 states. [2019-11-16 00:22:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16132 to 15826. [2019-11-16 00:22:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15826 states. [2019-11-16 00:22:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15826 states to 15826 states and 48840 transitions. [2019-11-16 00:22:22,555 INFO L78 Accepts]: Start accepts. Automaton has 15826 states and 48840 transitions. Word has length 80 [2019-11-16 00:22:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:22,556 INFO L462 AbstractCegarLoop]: Abstraction has 15826 states and 48840 transitions. [2019-11-16 00:22:22,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15826 states and 48840 transitions. [2019-11-16 00:22:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:22:22,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:22,567 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] [2019-11-16 00:22:22,567 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1841103327, now seen corresponding path program 1 times [2019-11-16 00:22:22,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:22,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578103473] [2019-11-16 00:22:22,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:22,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:22,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:22,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578103473] [2019-11-16 00:22:22,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:22,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:22:22,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025428249] [2019-11-16 00:22:22,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:22:22,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:22,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:22:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:22:22,642 INFO L87 Difference]: Start difference. First operand 15826 states and 48840 transitions. Second operand 5 states. [2019-11-16 00:22:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:23,379 INFO L93 Difference]: Finished difference Result 35182 states and 108171 transitions. [2019-11-16 00:22:23,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:23,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-16 00:22:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:23,633 INFO L225 Difference]: With dead ends: 35182 [2019-11-16 00:22:23,634 INFO L226 Difference]: Without dead ends: 35182 [2019-11-16 00:22:23,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-11-16 00:22:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 23176. [2019-11-16 00:22:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23176 states. [2019-11-16 00:22:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23176 states to 23176 states and 72489 transitions. [2019-11-16 00:22:23,982 INFO L78 Accepts]: Start accepts. Automaton has 23176 states and 72489 transitions. Word has length 81 [2019-11-16 00:22:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:23,982 INFO L462 AbstractCegarLoop]: Abstraction has 23176 states and 72489 transitions. [2019-11-16 00:22:23,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:22:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 23176 states and 72489 transitions. [2019-11-16 00:22:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:22:24,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:24,000 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] [2019-11-16 00:22:24,000 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1492249952, now seen corresponding path program 1 times [2019-11-16 00:22:24,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:24,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139194785] [2019-11-16 00:22:24,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:24,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:24,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:24,053 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-16 00:22:24,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139194785] [2019-11-16 00:22:24,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:24,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:22:24,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270834981] [2019-11-16 00:22:24,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:24,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:24,055 INFO L87 Difference]: Start difference. First operand 23176 states and 72489 transitions. Second operand 4 states. [2019-11-16 00:22:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:24,410 INFO L93 Difference]: Finished difference Result 28638 states and 88233 transitions. [2019-11-16 00:22:24,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:24,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-16 00:22:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:24,449 INFO L225 Difference]: With dead ends: 28638 [2019-11-16 00:22:24,449 INFO L226 Difference]: Without dead ends: 28584 [2019-11-16 00:22:24,450 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-16 00:22:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28584 states. [2019-11-16 00:22:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28584 to 26034. [2019-11-16 00:22:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26034 states. [2019-11-16 00:22:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26034 states to 26034 states and 80905 transitions. [2019-11-16 00:22:24,785 INFO L78 Accepts]: Start accepts. Automaton has 26034 states and 80905 transitions. Word has length 81 [2019-11-16 00:22:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:24,785 INFO L462 AbstractCegarLoop]: Abstraction has 26034 states and 80905 transitions. [2019-11-16 00:22:24,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 26034 states and 80905 transitions. [2019-11-16 00:22:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:22:24,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:24,803 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] [2019-11-16 00:22:24,803 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1880033761, now seen corresponding path program 1 times [2019-11-16 00:22:24,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:24,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405031109] [2019-11-16 00:22:24,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:24,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:24,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:24,905 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-16 00:22:24,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405031109] [2019-11-16 00:22:24,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:24,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:22:24,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327861032] [2019-11-16 00:22:24,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:22:24,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:24,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:22:24,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:22:24,907 INFO L87 Difference]: Start difference. First operand 26034 states and 80905 transitions. Second operand 8 states. [2019-11-16 00:22:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:26,878 INFO L93 Difference]: Finished difference Result 59615 states and 177262 transitions. [2019-11-16 00:22:26,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:22:26,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-11-16 00:22:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:26,963 INFO L225 Difference]: With dead ends: 59615 [2019-11-16 00:22:26,963 INFO L226 Difference]: Without dead ends: 59168 [2019-11-16 00:22:26,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:22:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59168 states. [2019-11-16 00:22:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59168 to 29760. [2019-11-16 00:22:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29760 states. [2019-11-16 00:22:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29760 states to 29760 states and 91313 transitions. [2019-11-16 00:22:27,481 INFO L78 Accepts]: Start accepts. Automaton has 29760 states and 91313 transitions. Word has length 81 [2019-11-16 00:22:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:27,482 INFO L462 AbstractCegarLoop]: Abstraction has 29760 states and 91313 transitions. [2019-11-16 00:22:27,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:22:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 29760 states and 91313 transitions. [2019-11-16 00:22:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:22:27,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:27,505 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] [2019-11-16 00:22:27,505 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1170169054, now seen corresponding path program 1 times [2019-11-16 00:22:27,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:27,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374700169] [2019-11-16 00:22:27,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:27,606 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-16 00:22:27,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374700169] [2019-11-16 00:22:27,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:27,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:22:27,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420539579] [2019-11-16 00:22:27,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:22:27,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:27,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:22:27,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:27,609 INFO L87 Difference]: Start difference. First operand 29760 states and 91313 transitions. Second operand 6 states. [2019-11-16 00:22:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:28,047 INFO L93 Difference]: Finished difference Result 31538 states and 96115 transitions. [2019-11-16 00:22:28,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:22:28,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-16 00:22:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:28,089 INFO L225 Difference]: With dead ends: 31538 [2019-11-16 00:22:28,089 INFO L226 Difference]: Without dead ends: 31513 [2019-11-16 00:22:28,090 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-16 00:22:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31513 states. [2019-11-16 00:22:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31513 to 30369. [2019-11-16 00:22:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30369 states. [2019-11-16 00:22:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30369 states to 30369 states and 92831 transitions. [2019-11-16 00:22:28,475 INFO L78 Accepts]: Start accepts. Automaton has 30369 states and 92831 transitions. Word has length 81 [2019-11-16 00:22:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:28,475 INFO L462 AbstractCegarLoop]: Abstraction has 30369 states and 92831 transitions. [2019-11-16 00:22:28,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:22:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 30369 states and 92831 transitions. [2019-11-16 00:22:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:22:28,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:28,497 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] [2019-11-16 00:22:28,497 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1189137955, now seen corresponding path program 1 times [2019-11-16 00:22:28,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:28,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525819402] [2019-11-16 00:22:28,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:28,605 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-16 00:22:28,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525819402] [2019-11-16 00:22:28,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:28,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:22:28,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738754619] [2019-11-16 00:22:28,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:22:28,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:28,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:22:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:28,607 INFO L87 Difference]: Start difference. First operand 30369 states and 92831 transitions. Second operand 6 states. [2019-11-16 00:22:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:29,096 INFO L93 Difference]: Finished difference Result 33304 states and 99448 transitions. [2019-11-16 00:22:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:22:29,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-16 00:22:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:29,138 INFO L225 Difference]: With dead ends: 33304 [2019-11-16 00:22:29,138 INFO L226 Difference]: Without dead ends: 33304 [2019-11-16 00:22:29,139 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-16 00:22:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33304 states. [2019-11-16 00:22:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33304 to 30103. [2019-11-16 00:22:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30103 states. [2019-11-16 00:22:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30103 states to 30103 states and 90448 transitions. [2019-11-16 00:22:29,516 INFO L78 Accepts]: Start accepts. Automaton has 30103 states and 90448 transitions. Word has length 81 [2019-11-16 00:22:29,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:29,517 INFO L462 AbstractCegarLoop]: Abstraction has 30103 states and 90448 transitions. [2019-11-16 00:22:29,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:22:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 30103 states and 90448 transitions. [2019-11-16 00:22:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:22:29,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:29,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:22:29,538 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash 274139235, now seen corresponding path program 1 times [2019-11-16 00:22:29,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:29,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635286482] [2019-11-16 00:22:29,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:29,606 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-16 00:22:29,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635286482] [2019-11-16 00:22:29,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:29,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:22:29,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600542243] [2019-11-16 00:22:29,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:22:29,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:29,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:22:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:22:29,608 INFO L87 Difference]: Start difference. First operand 30103 states and 90448 transitions. Second operand 5 states. [2019-11-16 00:22:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:29,967 INFO L93 Difference]: Finished difference Result 31312 states and 92985 transitions. [2019-11-16 00:22:29,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:29,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-16 00:22:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:30,009 INFO L225 Difference]: With dead ends: 31312 [2019-11-16 00:22:30,185 INFO L226 Difference]: Without dead ends: 31132 [2019-11-16 00:22:30,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31132 states. [2019-11-16 00:22:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31132 to 25783. [2019-11-16 00:22:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25783 states. [2019-11-16 00:22:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25783 states to 25783 states and 77713 transitions. [2019-11-16 00:22:30,517 INFO L78 Accepts]: Start accepts. Automaton has 25783 states and 77713 transitions. Word has length 81 [2019-11-16 00:22:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:30,517 INFO L462 AbstractCegarLoop]: Abstraction has 25783 states and 77713 transitions. [2019-11-16 00:22:30,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:22:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 25783 states and 77713 transitions. [2019-11-16 00:22:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:22:30,535 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:30,535 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] [2019-11-16 00:22:30,535 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1518903716, now seen corresponding path program 1 times [2019-11-16 00:22:30,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:30,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178775339] [2019-11-16 00:22:30,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:30,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:30,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:30,617 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-16 00:22:30,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178775339] [2019-11-16 00:22:30,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:30,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:22:30,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104286332] [2019-11-16 00:22:30,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:22:30,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:22:30,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:22:30,619 INFO L87 Difference]: Start difference. First operand 25783 states and 77713 transitions. Second operand 5 states. [2019-11-16 00:22:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:30,672 INFO L93 Difference]: Finished difference Result 2812 states and 6806 transitions. [2019-11-16 00:22:30,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:22:30,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-16 00:22:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:30,676 INFO L225 Difference]: With dead ends: 2812 [2019-11-16 00:22:30,676 INFO L226 Difference]: Without dead ends: 2500 [2019-11-16 00:22:30,676 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-16 00:22:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2019-11-16 00:22:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2393. [2019-11-16 00:22:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-11-16 00:22:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 5809 transitions. [2019-11-16 00:22:30,701 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 5809 transitions. Word has length 81 [2019-11-16 00:22:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:30,701 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 5809 transitions. [2019-11-16 00:22:30,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:22:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 5809 transitions. [2019-11-16 00:22:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:30,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:30,703 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:30,703 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:30,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:30,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1894335506, now seen corresponding path program 1 times [2019-11-16 00:22:30,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:30,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019288107] [2019-11-16 00:22:30,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:30,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:30,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:30,764 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-16 00:22:30,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019288107] [2019-11-16 00:22:30,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:30,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:22:30,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403204155] [2019-11-16 00:22:30,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:22:30,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:30,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:22:30,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:22:30,767 INFO L87 Difference]: Start difference. First operand 2393 states and 5809 transitions. Second operand 5 states. [2019-11-16 00:22:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:30,979 INFO L93 Difference]: Finished difference Result 2777 states and 6609 transitions. [2019-11-16 00:22:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:22:30,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:22:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:30,982 INFO L225 Difference]: With dead ends: 2777 [2019-11-16 00:22:30,982 INFO L226 Difference]: Without dead ends: 2759 [2019-11-16 00:22:30,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:22:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-11-16 00:22:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2462. [2019-11-16 00:22:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2019-11-16 00:22:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 5944 transitions. [2019-11-16 00:22:31,004 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 5944 transitions. Word has length 94 [2019-11-16 00:22:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:31,004 INFO L462 AbstractCegarLoop]: Abstraction has 2462 states and 5944 transitions. [2019-11-16 00:22:31,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:22:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 5944 transitions. [2019-11-16 00:22:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:31,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:31,006 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:31,006 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:31,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1301417684, now seen corresponding path program 1 times [2019-11-16 00:22:31,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:31,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860044108] [2019-11-16 00:22:31,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:31,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:31,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:31,221 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-16 00:22:31,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860044108] [2019-11-16 00:22:31,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:31,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:22:31,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380281049] [2019-11-16 00:22:31,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:22:31,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:22:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:22:31,223 INFO L87 Difference]: Start difference. First operand 2462 states and 5944 transitions. Second operand 10 states. [2019-11-16 00:22:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:31,985 INFO L93 Difference]: Finished difference Result 2756 states and 6529 transitions. [2019-11-16 00:22:31,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:22:31,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-16 00:22:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:31,987 INFO L225 Difference]: With dead ends: 2756 [2019-11-16 00:22:31,987 INFO L226 Difference]: Without dead ends: 2716 [2019-11-16 00:22:31,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:22:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-11-16 00:22:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2541. [2019-11-16 00:22:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-11-16 00:22:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 6120 transitions. [2019-11-16 00:22:32,008 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 6120 transitions. Word has length 94 [2019-11-16 00:22:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:32,009 INFO L462 AbstractCegarLoop]: Abstraction has 2541 states and 6120 transitions. [2019-11-16 00:22:32,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:22:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 6120 transitions. [2019-11-16 00:22:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:32,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:32,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:32,012 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash -634242603, now seen corresponding path program 1 times [2019-11-16 00:22:32,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:32,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416536837] [2019-11-16 00:22:32,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:32,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:32,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:32,100 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-16 00:22:32,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416536837] [2019-11-16 00:22:32,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:32,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:22:32,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180019908] [2019-11-16 00:22:32,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:22:32,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:32,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:22:32,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:32,105 INFO L87 Difference]: Start difference. First operand 2541 states and 6120 transitions. Second operand 6 states. [2019-11-16 00:22:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:32,305 INFO L93 Difference]: Finished difference Result 4354 states and 10531 transitions. [2019-11-16 00:22:32,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:22:32,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:22:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:32,312 INFO L225 Difference]: With dead ends: 4354 [2019-11-16 00:22:32,312 INFO L226 Difference]: Without dead ends: 4354 [2019-11-16 00:22:32,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2019-11-16 00:22:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 2579. [2019-11-16 00:22:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2019-11-16 00:22:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 6177 transitions. [2019-11-16 00:22:32,343 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 6177 transitions. Word has length 94 [2019-11-16 00:22:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:32,344 INFO L462 AbstractCegarLoop]: Abstraction has 2579 states and 6177 transitions. [2019-11-16 00:22:32,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:22:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 6177 transitions. [2019-11-16 00:22:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:32,346 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:32,346 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:22:32,346 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1959984214, now seen corresponding path program 1 times [2019-11-16 00:22:32,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:32,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326539734] [2019-11-16 00:22:32,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:32,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:32,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:32,438 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-16 00:22:32,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326539734] [2019-11-16 00:22:32,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:32,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:22:32,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197039129] [2019-11-16 00:22:32,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:22:32,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:32,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:22:32,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:32,440 INFO L87 Difference]: Start difference. First operand 2579 states and 6177 transitions. Second operand 6 states. [2019-11-16 00:22:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:32,709 INFO L93 Difference]: Finished difference Result 2755 states and 6550 transitions. [2019-11-16 00:22:32,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:22:32,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:22:32,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:32,712 INFO L225 Difference]: With dead ends: 2755 [2019-11-16 00:22:32,712 INFO L226 Difference]: Without dead ends: 2755 [2019-11-16 00:22:32,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-16 00:22:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2523. [2019-11-16 00:22:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-11-16 00:22:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 6056 transitions. [2019-11-16 00:22:32,732 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 6056 transitions. Word has length 94 [2019-11-16 00:22:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:32,732 INFO L462 AbstractCegarLoop]: Abstraction has 2523 states and 6056 transitions. [2019-11-16 00:22:32,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:22:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 6056 transitions. [2019-11-16 00:22:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:32,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:32,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:22:32,734 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:32,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:32,734 INFO L82 PathProgramCache]: Analyzing trace with hash -271803623, now seen corresponding path program 1 times [2019-11-16 00:22:32,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:32,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864021482] [2019-11-16 00:22:32,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:32,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:32,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:32,854 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-16 00:22:32,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864021482] [2019-11-16 00:22:32,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:32,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:22:32,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302201972] [2019-11-16 00:22:32,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:32,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:32,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:32,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:32,856 INFO L87 Difference]: Start difference. First operand 2523 states and 6056 transitions. Second operand 7 states. [2019-11-16 00:22:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:33,200 INFO L93 Difference]: Finished difference Result 3130 states and 7378 transitions. [2019-11-16 00:22:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:22:33,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-16 00:22:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:33,203 INFO L225 Difference]: With dead ends: 3130 [2019-11-16 00:22:33,203 INFO L226 Difference]: Without dead ends: 3130 [2019-11-16 00:22:33,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:22:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2019-11-16 00:22:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2595. [2019-11-16 00:22:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2019-11-16 00:22:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 6206 transitions. [2019-11-16 00:22:33,226 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 6206 transitions. Word has length 94 [2019-11-16 00:22:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:33,226 INFO L462 AbstractCegarLoop]: Abstraction has 2595 states and 6206 transitions. [2019-11-16 00:22:33,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 6206 transitions. [2019-11-16 00:22:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:33,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:33,228 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:33,228 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2087503386, now seen corresponding path program 1 times [2019-11-16 00:22:33,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:33,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171551412] [2019-11-16 00:22:33,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:33,308 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-16 00:22:33,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171551412] [2019-11-16 00:22:33,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:33,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:22:33,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454300003] [2019-11-16 00:22:33,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:22:33,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:33,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:22:33,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:22:33,310 INFO L87 Difference]: Start difference. First operand 2595 states and 6206 transitions. Second operand 5 states. [2019-11-16 00:22:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:33,355 INFO L93 Difference]: Finished difference Result 3840 states and 9343 transitions. [2019-11-16 00:22:33,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:22:33,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:22:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:33,361 INFO L225 Difference]: With dead ends: 3840 [2019-11-16 00:22:33,361 INFO L226 Difference]: Without dead ends: 3840 [2019-11-16 00:22:33,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2019-11-16 00:22:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 2378. [2019-11-16 00:22:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2019-11-16 00:22:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 5684 transitions. [2019-11-16 00:22:33,399 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 5684 transitions. Word has length 94 [2019-11-16 00:22:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:33,400 INFO L462 AbstractCegarLoop]: Abstraction has 2378 states and 5684 transitions. [2019-11-16 00:22:33,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:22:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 5684 transitions. [2019-11-16 00:22:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:33,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:33,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:33,403 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1877698149, now seen corresponding path program 1 times [2019-11-16 00:22:33,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:33,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138743345] [2019-11-16 00:22:33,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:33,624 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-16 00:22:33,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138743345] [2019-11-16 00:22:33,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:33,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-16 00:22:33,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177494595] [2019-11-16 00:22:33,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:22:33,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:22:33,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:22:33,627 INFO L87 Difference]: Start difference. First operand 2378 states and 5684 transitions. Second operand 12 states. [2019-11-16 00:22:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:33,965 INFO L93 Difference]: Finished difference Result 3808 states and 9248 transitions. [2019-11-16 00:22:33,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:22:33,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-11-16 00:22:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:33,967 INFO L225 Difference]: With dead ends: 3808 [2019-11-16 00:22:33,968 INFO L226 Difference]: Without dead ends: 2908 [2019-11-16 00:22:33,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:22:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-11-16 00:22:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2796. [2019-11-16 00:22:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2019-11-16 00:22:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 6601 transitions. [2019-11-16 00:22:33,990 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 6601 transitions. Word has length 94 [2019-11-16 00:22:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:33,990 INFO L462 AbstractCegarLoop]: Abstraction has 2796 states and 6601 transitions. [2019-11-16 00:22:33,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:22:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 6601 transitions. [2019-11-16 00:22:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:33,992 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:33,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:33,992 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1040933105, now seen corresponding path program 2 times [2019-11-16 00:22:33,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:33,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943077033] [2019-11-16 00:22:33,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:33,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:34,108 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-16 00:22:34,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943077033] [2019-11-16 00:22:34,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:34,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:22:34,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636559007] [2019-11-16 00:22:34,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:34,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:34,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:34,110 INFO L87 Difference]: Start difference. First operand 2796 states and 6601 transitions. Second operand 7 states. [2019-11-16 00:22:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:34,212 INFO L93 Difference]: Finished difference Result 4774 states and 11409 transitions. [2019-11-16 00:22:34,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:34,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-16 00:22:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:34,214 INFO L225 Difference]: With dead ends: 4774 [2019-11-16 00:22:34,215 INFO L226 Difference]: Without dead ends: 2205 [2019-11-16 00:22:34,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:22:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2019-11-16 00:22:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2205. [2019-11-16 00:22:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-11-16 00:22:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 5248 transitions. [2019-11-16 00:22:34,232 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 5248 transitions. Word has length 94 [2019-11-16 00:22:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:34,232 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 5248 transitions. [2019-11-16 00:22:34,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 5248 transitions. [2019-11-16 00:22:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:22:34,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:34,234 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:34,234 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:34,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash -778136179, now seen corresponding path program 3 times [2019-11-16 00:22:34,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:34,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051190678] [2019-11-16 00:22:34,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:34,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:34,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:34,348 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:34,348 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:22:34,503 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:22:34,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:22:34 BasicIcfg [2019-11-16 00:22:34,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:22:34,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:22:34,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:22:34,505 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:22:34,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:50" (3/4) ... [2019-11-16 00:22:34,508 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:22:34,614 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cbe0da84-6c19-4172-be8b-2fbf2dea3809/bin/uautomizer/witness.graphml [2019-11-16 00:22:34,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:22:34,616 INFO L168 Benchmark]: Toolchain (without parser) took 45926.08 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 943.4 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-16 00:22:34,616 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:34,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:34,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.05 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-16 00:22:34,617 INFO L168 Benchmark]: Boogie Preprocessor took 34.24 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-16 00:22:34,618 INFO L168 Benchmark]: RCFGBuilder took 814.16 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-16 00:22:34,618 INFO L168 Benchmark]: TraceAbstraction took 44229.81 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-16 00:22:34,619 INFO L168 Benchmark]: Witness Printer took 109.06 ms. Allocated memory is still 4.6 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:34,620 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.46 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 676.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.05 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 34.24 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 814.16 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 44229.81 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 109.06 ms. Allocated memory is still 4.6 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2013; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L781] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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=2] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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=2] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 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) [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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] [L758] 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 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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] [L760] 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 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 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) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 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 [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 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 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 175 locations, 3 error locations. Result: UNSAFE, OverallTime: 44.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8443 SDtfs, 9978 SDslu, 20645 SDs, 0 SdLazy, 9287 SolverSat, 595 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 98 SyntacticMatches, 15 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66329occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 167887 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2412 NumberOfCodeBlocks, 2412 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2287 ConstructedInterpolants, 0 QuantifiedInterpolants, 449043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...