./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/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 71cd3df5157f425f115015ed72d90be02a963e5a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:55:50,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:55:50,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:55:50,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:55:50,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:55:50,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:55:50,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:55:50,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:55:50,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:55:50,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:55:50,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:55:50,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:55:50,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:55:50,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:55:50,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:55:50,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:55:50,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:55:50,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:55:50,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:55:50,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:55:50,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:55:50,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:55:50,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:55:50,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:55:50,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:55:50,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:55:50,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:55:50,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:55:50,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:55:50,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:55:50,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:55:50,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:55:50,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:55:50,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:55:50,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:55:50,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:55:50,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:55:50,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:55:50,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:55:50,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:55:50,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:55:50,701 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:55:50,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:55:50,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:55:50,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:55:50,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:55:50,736 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:55:50,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:55:50,737 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:55:50,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:55:50,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:55:50,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:55:50,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:55:50,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:55:50,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:55:50,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:55:50,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:55:50,739 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:55:50,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:55:50,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:55:50,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:55:50,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:55:50,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:55:50,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:55:50,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:55:50,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:55:50,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:55:50,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:55:50,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:55:50,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:55:50,742 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_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/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 -> 71cd3df5157f425f115015ed72d90be02a963e5a [2019-11-15 20:55:50,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:55:50,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:55:50,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:55:50,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:55:50,780 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:55:50,780 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt.i [2019-11-15 20:55:50,835 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/data/a4f50fcc7/01aeba1f65b4468bbb6a1f5b6b3a6f25/FLAGda132ca03 [2019-11-15 20:55:51,314 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:55:51,315 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/sv-benchmarks/c/pthread-wmm/safe029_power.opt.i [2019-11-15 20:55:51,328 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/data/a4f50fcc7/01aeba1f65b4468bbb6a1f5b6b3a6f25/FLAGda132ca03 [2019-11-15 20:55:51,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/data/a4f50fcc7/01aeba1f65b4468bbb6a1f5b6b3a6f25 [2019-11-15 20:55:51,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:55:51,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:55:51,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:55:51,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:55:51,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:55:51,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:55:51" (1/1) ... [2019-11-15 20:55:51,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4544c513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:51, skipping insertion in model container [2019-11-15 20:55:51,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:55:51" (1/1) ... [2019-11-15 20:55:51,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:55:51,719 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:55:52,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:55:52,209 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:55:52,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:55:52,350 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:55:52,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52 WrapperNode [2019-11-15 20:55:52,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:55:52,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:55:52,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:55:52,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:55:52,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:55:52,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:55:52,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:55:52,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:55:52,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... [2019-11-15 20:55:52,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:55:52,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:55:52,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:55:52,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:55:52,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:55:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:55:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:55:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:55:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:55:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:55:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:55:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:55:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:55:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:55:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:55:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:55:52,514 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 20:55:53,202 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:55:53,202 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:55:53,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:55:53 BoogieIcfgContainer [2019-11-15 20:55:53,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:55:53,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:55:53,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:55:53,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:55:53,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:55:51" (1/3) ... [2019-11-15 20:55:53,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6dc082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:55:53, skipping insertion in model container [2019-11-15 20:55:53,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:52" (2/3) ... [2019-11-15 20:55:53,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6dc082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:55:53, skipping insertion in model container [2019-11-15 20:55:53,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:55:53" (3/3) ... [2019-11-15 20:55:53,210 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2019-11-15 20:55:53,267 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,268 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,268 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,268 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,268 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,271 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,271 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,271 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,271 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,273 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,273 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,273 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,275 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,276 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,276 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,276 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,277 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,277 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,277 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,277 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,278 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,278 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,279 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,279 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,280 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,281 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,281 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,281 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,282 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,282 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,282 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,283 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,283 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,283 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,284 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,284 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,284 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,284 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,285 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,285 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,285 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,285 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,286 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:55:53,293 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:55:53,293 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:55:53,303 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:55:53,314 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:55:53,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:55:53,329 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:55:53,329 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:55:53,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:55:53,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:55:53,329 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:55:53,329 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:55:53,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:55:53,340 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 176 transitions [2019-11-15 20:55:54,932 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22492 states. [2019-11-15 20:55:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 22492 states. [2019-11-15 20:55:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 20:55:54,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:55:54,946 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] [2019-11-15 20:55:54,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:55:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash 379878024, now seen corresponding path program 1 times [2019-11-15 20:55:54,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:54,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500989218] [2019-11-15 20:55:54,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:54,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:54,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:55:55,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500989218] [2019-11-15 20:55:55,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:55:55,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:55:55,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976082986] [2019-11-15 20:55:55,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:55:55,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:55:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:55:55,276 INFO L87 Difference]: Start difference. First operand 22492 states. Second operand 4 states. [2019-11-15 20:55:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:55,808 INFO L93 Difference]: Finished difference Result 23444 states and 91745 transitions. [2019-11-15 20:55:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:55:55,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 20:55:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:55:56,020 INFO L225 Difference]: With dead ends: 23444 [2019-11-15 20:55:56,021 INFO L226 Difference]: Without dead ends: 21268 [2019-11-15 20:55:56,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:55:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21268 states. [2019-11-15 20:55:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21268 to 21268. [2019-11-15 20:55:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21268 states. [2019-11-15 20:55:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21268 states to 21268 states and 83769 transitions. [2019-11-15 20:55:57,248 INFO L78 Accepts]: Start accepts. Automaton has 21268 states and 83769 transitions. Word has length 35 [2019-11-15 20:55:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:55:57,249 INFO L462 AbstractCegarLoop]: Abstraction has 21268 states and 83769 transitions. [2019-11-15 20:55:57,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:55:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21268 states and 83769 transitions. [2019-11-15 20:55:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 20:55:57,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:55:57,256 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] [2019-11-15 20:55:57,256 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:55:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1392166447, now seen corresponding path program 1 times [2019-11-15 20:55:57,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:57,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167774764] [2019-11-15 20:55:57,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:57,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:57,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:55:57,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167774764] [2019-11-15 20:55:57,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:55:57,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:55:57,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974034691] [2019-11-15 20:55:57,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:55:57,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:55:57,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:55:57,358 INFO L87 Difference]: Start difference. First operand 21268 states and 83769 transitions. Second operand 5 states. [2019-11-15 20:55:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:58,087 INFO L93 Difference]: Finished difference Result 34702 states and 129061 transitions. [2019-11-15 20:55:58,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:55:58,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-15 20:55:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:55:58,242 INFO L225 Difference]: With dead ends: 34702 [2019-11-15 20:55:58,243 INFO L226 Difference]: Without dead ends: 34558 [2019-11-15 20:55:58,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:55:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34558 states. [2019-11-15 20:55:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34558 to 33058. [2019-11-15 20:55:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33058 states. [2019-11-15 20:55:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33058 states to 33058 states and 123949 transitions. [2019-11-15 20:55:59,519 INFO L78 Accepts]: Start accepts. Automaton has 33058 states and 123949 transitions. Word has length 42 [2019-11-15 20:55:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:55:59,520 INFO L462 AbstractCegarLoop]: Abstraction has 33058 states and 123949 transitions. [2019-11-15 20:55:59,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:55:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33058 states and 123949 transitions. [2019-11-15 20:55:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 20:55:59,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:55:59,525 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:55:59,525 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:55:59,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:59,525 INFO L82 PathProgramCache]: Analyzing trace with hash -791986806, now seen corresponding path program 1 times [2019-11-15 20:55:59,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:59,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958262076] [2019-11-15 20:55:59,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:59,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:59,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:55:59,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958262076] [2019-11-15 20:55:59,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:55:59,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:55:59,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415543992] [2019-11-15 20:55:59,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:55:59,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:59,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:55:59,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:55:59,589 INFO L87 Difference]: Start difference. First operand 33058 states and 123949 transitions. Second operand 5 states. [2019-11-15 20:56:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:00,481 INFO L93 Difference]: Finished difference Result 40210 states and 148618 transitions. [2019-11-15 20:56:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:56:00,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-15 20:56:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:00,640 INFO L225 Difference]: With dead ends: 40210 [2019-11-15 20:56:00,641 INFO L226 Difference]: Without dead ends: 40050 [2019-11-15 20:56:00,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:56:00,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40050 states. [2019-11-15 20:56:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40050 to 34631. [2019-11-15 20:56:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34631 states. [2019-11-15 20:56:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34631 states to 34631 states and 129245 transitions. [2019-11-15 20:56:01,558 INFO L78 Accepts]: Start accepts. Automaton has 34631 states and 129245 transitions. Word has length 43 [2019-11-15 20:56:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:01,559 INFO L462 AbstractCegarLoop]: Abstraction has 34631 states and 129245 transitions. [2019-11-15 20:56:01,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:56:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 34631 states and 129245 transitions. [2019-11-15 20:56:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 20:56:01,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:01,572 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] [2019-11-15 20:56:01,573 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash 944186895, now seen corresponding path program 1 times [2019-11-15 20:56:01,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:01,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959918021] [2019-11-15 20:56:01,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:01,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:01,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:01,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959918021] [2019-11-15 20:56:01,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:01,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:01,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691963120] [2019-11-15 20:56:01,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:01,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:01,706 INFO L87 Difference]: Start difference. First operand 34631 states and 129245 transitions. Second operand 6 states. [2019-11-15 20:56:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:03,059 INFO L93 Difference]: Finished difference Result 45659 states and 166139 transitions. [2019-11-15 20:56:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:56:03,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-15 20:56:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:03,139 INFO L225 Difference]: With dead ends: 45659 [2019-11-15 20:56:03,139 INFO L226 Difference]: Without dead ends: 45515 [2019-11-15 20:56:03,139 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-15 20:56:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45515 states. [2019-11-15 20:56:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45515 to 33594. [2019-11-15 20:56:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33594 states. [2019-11-15 20:56:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33594 states to 33594 states and 125400 transitions. [2019-11-15 20:56:03,866 INFO L78 Accepts]: Start accepts. Automaton has 33594 states and 125400 transitions. Word has length 50 [2019-11-15 20:56:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:03,866 INFO L462 AbstractCegarLoop]: Abstraction has 33594 states and 125400 transitions. [2019-11-15 20:56:03,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 33594 states and 125400 transitions. [2019-11-15 20:56:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 20:56:03,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:03,899 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] [2019-11-15 20:56:03,899 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2101076912, now seen corresponding path program 1 times [2019-11-15 20:56:03,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:03,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992559234] [2019-11-15 20:56:03,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:03,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:03,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:03,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992559234] [2019-11-15 20:56:03,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:03,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:56:03,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341580064] [2019-11-15 20:56:03,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:56:03,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:03,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:56:03,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:56:03,955 INFO L87 Difference]: Start difference. First operand 33594 states and 125400 transitions. Second operand 3 states. [2019-11-15 20:56:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:04,174 INFO L93 Difference]: Finished difference Result 36895 states and 137091 transitions. [2019-11-15 20:56:04,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:56:04,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-15 20:56:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:04,689 INFO L225 Difference]: With dead ends: 36895 [2019-11-15 20:56:04,689 INFO L226 Difference]: Without dead ends: 36895 [2019-11-15 20:56:04,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:56:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36895 states. [2019-11-15 20:56:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36895 to 36301. [2019-11-15 20:56:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36301 states. [2019-11-15 20:56:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36301 states to 36301 states and 135069 transitions. [2019-11-15 20:56:05,266 INFO L78 Accepts]: Start accepts. Automaton has 36301 states and 135069 transitions. Word has length 57 [2019-11-15 20:56:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:05,266 INFO L462 AbstractCegarLoop]: Abstraction has 36301 states and 135069 transitions. [2019-11-15 20:56:05,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:56:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 36301 states and 135069 transitions. [2019-11-15 20:56:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 20:56:05,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:05,293 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] [2019-11-15 20:56:05,293 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash 747767215, now seen corresponding path program 1 times [2019-11-15 20:56:05,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:05,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707107129] [2019-11-15 20:56:05,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:05,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:05,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:05,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707107129] [2019-11-15 20:56:05,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:05,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:05,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171552614] [2019-11-15 20:56:05,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:05,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:05,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:05,376 INFO L87 Difference]: Start difference. First operand 36301 states and 135069 transitions. Second operand 6 states. [2019-11-15 20:56:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:06,015 INFO L93 Difference]: Finished difference Result 49087 states and 178537 transitions. [2019-11-15 20:56:06,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:56:06,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-15 20:56:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:06,097 INFO L225 Difference]: With dead ends: 49087 [2019-11-15 20:56:06,097 INFO L226 Difference]: Without dead ends: 48847 [2019-11-15 20:56:06,097 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-15 20:56:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48847 states. [2019-11-15 20:56:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48847 to 42913. [2019-11-15 20:56:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42913 states. [2019-11-15 20:56:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42913 states to 42913 states and 157817 transitions. [2019-11-15 20:56:07,483 INFO L78 Accepts]: Start accepts. Automaton has 42913 states and 157817 transitions. Word has length 57 [2019-11-15 20:56:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:07,483 INFO L462 AbstractCegarLoop]: Abstraction has 42913 states and 157817 transitions. [2019-11-15 20:56:07,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 42913 states and 157817 transitions. [2019-11-15 20:56:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:56:07,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:07,514 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:07,514 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1861127999, now seen corresponding path program 1 times [2019-11-15 20:56:07,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:07,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845659763] [2019-11-15 20:56:07,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:07,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:07,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:07,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845659763] [2019-11-15 20:56:07,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:07,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:56:07,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132107082] [2019-11-15 20:56:07,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:56:07,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:07,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:56:07,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:56:07,575 INFO L87 Difference]: Start difference. First operand 42913 states and 157817 transitions. Second operand 3 states. [2019-11-15 20:56:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:07,829 INFO L93 Difference]: Finished difference Result 53211 states and 192652 transitions. [2019-11-15 20:56:07,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:56:07,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-15 20:56:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:07,929 INFO L225 Difference]: With dead ends: 53211 [2019-11-15 20:56:07,929 INFO L226 Difference]: Without dead ends: 53211 [2019-11-15 20:56:07,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:56:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53211 states. [2019-11-15 20:56:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53211 to 46771. [2019-11-15 20:56:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46771 states. [2019-11-15 20:56:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46771 states to 46771 states and 171039 transitions. [2019-11-15 20:56:08,742 INFO L78 Accepts]: Start accepts. Automaton has 46771 states and 171039 transitions. Word has length 59 [2019-11-15 20:56:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:08,742 INFO L462 AbstractCegarLoop]: Abstraction has 46771 states and 171039 transitions. [2019-11-15 20:56:08,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:56:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 46771 states and 171039 transitions. [2019-11-15 20:56:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 20:56:08,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:08,779 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:08,780 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1336008671, now seen corresponding path program 1 times [2019-11-15 20:56:08,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:08,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217479358] [2019-11-15 20:56:08,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:08,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:08,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:08,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217479358] [2019-11-15 20:56:08,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:08,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:56:08,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165254447] [2019-11-15 20:56:08,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:56:08,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:56:08,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:08,891 INFO L87 Difference]: Start difference. First operand 46771 states and 171039 transitions. Second operand 7 states. [2019-11-15 20:56:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:09,770 INFO L93 Difference]: Finished difference Result 58902 states and 211200 transitions. [2019-11-15 20:56:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:56:09,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-11-15 20:56:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:09,880 INFO L225 Difference]: With dead ends: 58902 [2019-11-15 20:56:09,880 INFO L226 Difference]: Without dead ends: 58662 [2019-11-15 20:56:09,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:56:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58662 states. [2019-11-15 20:56:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58662 to 48069. [2019-11-15 20:56:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48069 states. [2019-11-15 20:56:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48069 states to 48069 states and 175422 transitions. [2019-11-15 20:56:11,313 INFO L78 Accepts]: Start accepts. Automaton has 48069 states and 175422 transitions. Word has length 63 [2019-11-15 20:56:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:11,313 INFO L462 AbstractCegarLoop]: Abstraction has 48069 states and 175422 transitions. [2019-11-15 20:56:11,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:56:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 48069 states and 175422 transitions. [2019-11-15 20:56:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 20:56:11,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:11,341 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-15 20:56:11,341 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash -401202828, now seen corresponding path program 1 times [2019-11-15 20:56:11,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:11,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848864962] [2019-11-15 20:56:11,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:11,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:11,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:11,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848864962] [2019-11-15 20:56:11,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:11,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:56:11,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755696319] [2019-11-15 20:56:11,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:56:11,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:11,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:56:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:11,429 INFO L87 Difference]: Start difference. First operand 48069 states and 175422 transitions. Second operand 7 states. [2019-11-15 20:56:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:12,543 INFO L93 Difference]: Finished difference Result 58053 states and 208166 transitions. [2019-11-15 20:56:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:56:12,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-15 20:56:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:12,657 INFO L225 Difference]: With dead ends: 58053 [2019-11-15 20:56:12,657 INFO L226 Difference]: Without dead ends: 57853 [2019-11-15 20:56:12,658 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-15 20:56:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57853 states. [2019-11-15 20:56:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57853 to 48947. [2019-11-15 20:56:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48947 states. [2019-11-15 20:56:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48947 states to 48947 states and 178293 transitions. [2019-11-15 20:56:13,500 INFO L78 Accepts]: Start accepts. Automaton has 48947 states and 178293 transitions. Word has length 64 [2019-11-15 20:56:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:13,501 INFO L462 AbstractCegarLoop]: Abstraction has 48947 states and 178293 transitions. [2019-11-15 20:56:13,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:56:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 48947 states and 178293 transitions. [2019-11-15 20:56:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:56:13,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:13,539 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:13,539 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -182823054, now seen corresponding path program 1 times [2019-11-15 20:56:13,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:13,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208764054] [2019-11-15 20:56:13,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:13,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:13,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:13,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208764054] [2019-11-15 20:56:13,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:13,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:56:13,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083045739] [2019-11-15 20:56:13,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:56:13,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:13,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:56:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:13,646 INFO L87 Difference]: Start difference. First operand 48947 states and 178293 transitions. Second operand 7 states. [2019-11-15 20:56:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:15,168 INFO L93 Difference]: Finished difference Result 78799 states and 276302 transitions. [2019-11-15 20:56:15,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:56:15,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-15 20:56:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:15,301 INFO L225 Difference]: With dead ends: 78799 [2019-11-15 20:56:15,301 INFO L226 Difference]: Without dead ends: 78799 [2019-11-15 20:56:15,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:56:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78799 states. [2019-11-15 20:56:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78799 to 71293. [2019-11-15 20:56:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71293 states. [2019-11-15 20:56:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71293 states to 71293 states and 252134 transitions. [2019-11-15 20:56:16,458 INFO L78 Accepts]: Start accepts. Automaton has 71293 states and 252134 transitions. Word has length 66 [2019-11-15 20:56:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:16,459 INFO L462 AbstractCegarLoop]: Abstraction has 71293 states and 252134 transitions. [2019-11-15 20:56:16,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:56:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 71293 states and 252134 transitions. [2019-11-15 20:56:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:56:16,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:16,522 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:16,523 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1061941427, now seen corresponding path program 1 times [2019-11-15 20:56:16,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:16,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832016744] [2019-11-15 20:56:16,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:16,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:16,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:16,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832016744] [2019-11-15 20:56:16,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:16,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:56:16,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017624161] [2019-11-15 20:56:16,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:56:16,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:16,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:56:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:56:16,598 INFO L87 Difference]: Start difference. First operand 71293 states and 252134 transitions. Second operand 4 states. [2019-11-15 20:56:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:16,678 INFO L93 Difference]: Finished difference Result 15853 states and 50021 transitions. [2019-11-15 20:56:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:56:16,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 20:56:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:16,701 INFO L225 Difference]: With dead ends: 15853 [2019-11-15 20:56:16,701 INFO L226 Difference]: Without dead ends: 15375 [2019-11-15 20:56:16,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:56:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15375 states. [2019-11-15 20:56:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15375 to 15363. [2019-11-15 20:56:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15363 states. [2019-11-15 20:56:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15363 states to 15363 states and 48516 transitions. [2019-11-15 20:56:16,876 INFO L78 Accepts]: Start accepts. Automaton has 15363 states and 48516 transitions. Word has length 66 [2019-11-15 20:56:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:16,877 INFO L462 AbstractCegarLoop]: Abstraction has 15363 states and 48516 transitions. [2019-11-15 20:56:16,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:56:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 15363 states and 48516 transitions. [2019-11-15 20:56:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:56:16,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:16,886 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] [2019-11-15 20:56:16,886 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash 300629220, now seen corresponding path program 1 times [2019-11-15 20:56:16,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:16,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076766196] [2019-11-15 20:56:16,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:16,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:16,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:16,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076766196] [2019-11-15 20:56:16,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:16,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:56:16,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666063237] [2019-11-15 20:56:16,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:56:16,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:16,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:56:16,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:56:16,961 INFO L87 Difference]: Start difference. First operand 15363 states and 48516 transitions. Second operand 4 states. [2019-11-15 20:56:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:17,221 INFO L93 Difference]: Finished difference Result 20070 states and 62647 transitions. [2019-11-15 20:56:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:56:17,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:56:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:17,255 INFO L225 Difference]: With dead ends: 20070 [2019-11-15 20:56:17,256 INFO L226 Difference]: Without dead ends: 20070 [2019-11-15 20:56:17,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:56:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2019-11-15 20:56:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 16200. [2019-11-15 20:56:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-11-15 20:56:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 50965 transitions. [2019-11-15 20:56:17,457 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 50965 transitions. Word has length 76 [2019-11-15 20:56:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:17,458 INFO L462 AbstractCegarLoop]: Abstraction has 16200 states and 50965 transitions. [2019-11-15 20:56:17,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:56:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 50965 transitions. [2019-11-15 20:56:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:56:17,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:17,467 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] [2019-11-15 20:56:17,467 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1290657156, now seen corresponding path program 1 times [2019-11-15 20:56:17,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:17,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593971841] [2019-11-15 20:56:17,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:17,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:17,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:17,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593971841] [2019-11-15 20:56:17,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:17,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:56:17,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681060216] [2019-11-15 20:56:17,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:56:17,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:56:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:56:17,561 INFO L87 Difference]: Start difference. First operand 16200 states and 50965 transitions. Second operand 8 states. [2019-11-15 20:56:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:18,758 INFO L93 Difference]: Finished difference Result 18348 states and 57194 transitions. [2019-11-15 20:56:18,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 20:56:18,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-11-15 20:56:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:18,790 INFO L225 Difference]: With dead ends: 18348 [2019-11-15 20:56:18,791 INFO L226 Difference]: Without dead ends: 18300 [2019-11-15 20:56:18,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-11-15 20:56:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18300 states. [2019-11-15 20:56:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18300 to 14079. [2019-11-15 20:56:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14079 states. [2019-11-15 20:56:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14079 states to 14079 states and 44586 transitions. [2019-11-15 20:56:19,162 INFO L78 Accepts]: Start accepts. Automaton has 14079 states and 44586 transitions. Word has length 76 [2019-11-15 20:56:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:19,162 INFO L462 AbstractCegarLoop]: Abstraction has 14079 states and 44586 transitions. [2019-11-15 20:56:19,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:56:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 14079 states and 44586 transitions. [2019-11-15 20:56:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 20:56:19,171 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:19,171 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-15 20:56:19,172 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:19,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash -91760962, now seen corresponding path program 1 times [2019-11-15 20:56:19,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:19,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857498735] [2019-11-15 20:56:19,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:19,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:19,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:19,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857498735] [2019-11-15 20:56:19,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:19,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:56:19,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844993828] [2019-11-15 20:56:19,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:56:19,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:56:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:56:19,224 INFO L87 Difference]: Start difference. First operand 14079 states and 44586 transitions. Second operand 3 states. [2019-11-15 20:56:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:19,412 INFO L93 Difference]: Finished difference Result 15115 states and 47655 transitions. [2019-11-15 20:56:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:56:19,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-15 20:56:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:19,431 INFO L225 Difference]: With dead ends: 15115 [2019-11-15 20:56:19,431 INFO L226 Difference]: Without dead ends: 15115 [2019-11-15 20:56:19,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:56:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2019-11-15 20:56:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 14581. [2019-11-15 20:56:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14581 states. [2019-11-15 20:56:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14581 states to 14581 states and 46078 transitions. [2019-11-15 20:56:19,602 INFO L78 Accepts]: Start accepts. Automaton has 14581 states and 46078 transitions. Word has length 77 [2019-11-15 20:56:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:19,602 INFO L462 AbstractCegarLoop]: Abstraction has 14581 states and 46078 transitions. [2019-11-15 20:56:19,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:56:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14581 states and 46078 transitions. [2019-11-15 20:56:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 20:56:19,612 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:19,613 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] [2019-11-15 20:56:19,613 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:19,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2098836392, now seen corresponding path program 1 times [2019-11-15 20:56:19,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:19,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12681496] [2019-11-15 20:56:19,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:19,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:19,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:19,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12681496] [2019-11-15 20:56:19,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:19,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:56:19,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685671556] [2019-11-15 20:56:19,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:56:19,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:19,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:56:19,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:56:19,667 INFO L87 Difference]: Start difference. First operand 14581 states and 46078 transitions. Second operand 4 states. [2019-11-15 20:56:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:20,032 INFO L93 Difference]: Finished difference Result 17952 states and 55817 transitions. [2019-11-15 20:56:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:56:20,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 20:56:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:20,063 INFO L225 Difference]: With dead ends: 17952 [2019-11-15 20:56:20,063 INFO L226 Difference]: Without dead ends: 17952 [2019-11-15 20:56:20,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:56:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2019-11-15 20:56:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16884. [2019-11-15 20:56:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16884 states. [2019-11-15 20:56:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16884 states to 16884 states and 52804 transitions. [2019-11-15 20:56:20,267 INFO L78 Accepts]: Start accepts. Automaton has 16884 states and 52804 transitions. Word has length 78 [2019-11-15 20:56:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:20,267 INFO L462 AbstractCegarLoop]: Abstraction has 16884 states and 52804 transitions. [2019-11-15 20:56:20,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:56:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 16884 states and 52804 transitions. [2019-11-15 20:56:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 20:56:20,280 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:20,280 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] [2019-11-15 20:56:20,280 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:20,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash 163176105, now seen corresponding path program 1 times [2019-11-15 20:56:20,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:20,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340975017] [2019-11-15 20:56:20,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:20,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:20,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:20,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340975017] [2019-11-15 20:56:20,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:20,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:56:20,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354904627] [2019-11-15 20:56:20,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:56:20,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:20,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:56:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:56:20,354 INFO L87 Difference]: Start difference. First operand 16884 states and 52804 transitions. Second operand 3 states. [2019-11-15 20:56:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:20,619 INFO L93 Difference]: Finished difference Result 17987 states and 56059 transitions. [2019-11-15 20:56:20,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:56:20,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-15 20:56:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:20,640 INFO L225 Difference]: With dead ends: 17987 [2019-11-15 20:56:20,641 INFO L226 Difference]: Without dead ends: 17987 [2019-11-15 20:56:20,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:56:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17987 states. [2019-11-15 20:56:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17987 to 17442. [2019-11-15 20:56:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17442 states. [2019-11-15 20:56:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17442 states to 17442 states and 54446 transitions. [2019-11-15 20:56:20,843 INFO L78 Accepts]: Start accepts. Automaton has 17442 states and 54446 transitions. Word has length 78 [2019-11-15 20:56:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:20,843 INFO L462 AbstractCegarLoop]: Abstraction has 17442 states and 54446 transitions. [2019-11-15 20:56:20,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:56:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17442 states and 54446 transitions. [2019-11-15 20:56:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:56:20,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:20,856 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash 452490126, now seen corresponding path program 1 times [2019-11-15 20:56:20,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:20,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410035321] [2019-11-15 20:56:20,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:20,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:20,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:20,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410035321] [2019-11-15 20:56:20,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:20,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:56:20,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826939832] [2019-11-15 20:56:20,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:56:20,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:20,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:56:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:56:20,924 INFO L87 Difference]: Start difference. First operand 17442 states and 54446 transitions. Second operand 4 states. [2019-11-15 20:56:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:21,341 INFO L93 Difference]: Finished difference Result 28784 states and 89522 transitions. [2019-11-15 20:56:21,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:56:21,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 20:56:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:21,379 INFO L225 Difference]: With dead ends: 28784 [2019-11-15 20:56:21,379 INFO L226 Difference]: Without dead ends: 28784 [2019-11-15 20:56:21,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:56:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28784 states. [2019-11-15 20:56:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28784 to 16157. [2019-11-15 20:56:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16157 states. [2019-11-15 20:56:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16157 states to 16157 states and 49908 transitions. [2019-11-15 20:56:21,628 INFO L78 Accepts]: Start accepts. Automaton has 16157 states and 49908 transitions. Word has length 79 [2019-11-15 20:56:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:21,628 INFO L462 AbstractCegarLoop]: Abstraction has 16157 states and 49908 transitions. [2019-11-15 20:56:21,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:56:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 16157 states and 49908 transitions. [2019-11-15 20:56:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:56:21,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:21,640 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] [2019-11-15 20:56:21,640 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:21,641 INFO L82 PathProgramCache]: Analyzing trace with hash 782255887, now seen corresponding path program 1 times [2019-11-15 20:56:21,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:21,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409463559] [2019-11-15 20:56:21,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:21,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:21,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:21,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409463559] [2019-11-15 20:56:21,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:21,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:56:21,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472125466] [2019-11-15 20:56:21,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:56:21,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:56:21,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:56:21,699 INFO L87 Difference]: Start difference. First operand 16157 states and 49908 transitions. Second operand 5 states. [2019-11-15 20:56:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:22,481 INFO L93 Difference]: Finished difference Result 33616 states and 102443 transitions. [2019-11-15 20:56:22,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:56:22,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-15 20:56:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:22,523 INFO L225 Difference]: With dead ends: 33616 [2019-11-15 20:56:22,523 INFO L226 Difference]: Without dead ends: 33616 [2019-11-15 20:56:22,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:56:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33616 states. [2019-11-15 20:56:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33616 to 18628. [2019-11-15 20:56:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18628 states. [2019-11-15 20:56:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18628 states to 18628 states and 57315 transitions. [2019-11-15 20:56:22,805 INFO L78 Accepts]: Start accepts. Automaton has 18628 states and 57315 transitions. Word has length 79 [2019-11-15 20:56:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:22,805 INFO L462 AbstractCegarLoop]: Abstraction has 18628 states and 57315 transitions. [2019-11-15 20:56:22,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:56:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 18628 states and 57315 transitions. [2019-11-15 20:56:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:56:22,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:22,818 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] [2019-11-15 20:56:22,818 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash -140427696, now seen corresponding path program 1 times [2019-11-15 20:56:22,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:22,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631260031] [2019-11-15 20:56:22,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:22,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:22,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:22,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631260031] [2019-11-15 20:56:22,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:22,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:56:22,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642984213] [2019-11-15 20:56:22,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:56:22,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:22,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:56:22,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:22,918 INFO L87 Difference]: Start difference. First operand 18628 states and 57315 transitions. Second operand 7 states. [2019-11-15 20:56:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:23,975 INFO L93 Difference]: Finished difference Result 33280 states and 101204 transitions. [2019-11-15 20:56:23,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:56:23,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-15 20:56:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:24,015 INFO L225 Difference]: With dead ends: 33280 [2019-11-15 20:56:24,015 INFO L226 Difference]: Without dead ends: 33280 [2019-11-15 20:56:24,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:56:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33280 states. [2019-11-15 20:56:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33280 to 21892. [2019-11-15 20:56:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21892 states. [2019-11-15 20:56:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21892 states to 21892 states and 67118 transitions. [2019-11-15 20:56:24,350 INFO L78 Accepts]: Start accepts. Automaton has 21892 states and 67118 transitions. Word has length 79 [2019-11-15 20:56:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:24,350 INFO L462 AbstractCegarLoop]: Abstraction has 21892 states and 67118 transitions. [2019-11-15 20:56:24,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:56:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21892 states and 67118 transitions. [2019-11-15 20:56:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:56:24,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:24,371 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] [2019-11-15 20:56:24,371 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1104336785, now seen corresponding path program 1 times [2019-11-15 20:56:24,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:24,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710389893] [2019-11-15 20:56:24,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:24,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:24,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:24,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710389893] [2019-11-15 20:56:24,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:24,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:56:24,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227059145] [2019-11-15 20:56:24,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:56:24,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:56:24,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:56:24,458 INFO L87 Difference]: Start difference. First operand 21892 states and 67118 transitions. Second operand 5 states. [2019-11-15 20:56:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:24,506 INFO L93 Difference]: Finished difference Result 4171 states and 10139 transitions. [2019-11-15 20:56:24,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:56:24,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-15 20:56:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:24,511 INFO L225 Difference]: With dead ends: 4171 [2019-11-15 20:56:24,511 INFO L226 Difference]: Without dead ends: 3346 [2019-11-15 20:56:24,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-11-15 20:56:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2598. [2019-11-15 20:56:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2019-11-15 20:56:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 6364 transitions. [2019-11-15 20:56:24,551 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 6364 transitions. Word has length 79 [2019-11-15 20:56:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:24,552 INFO L462 AbstractCegarLoop]: Abstraction has 2598 states and 6364 transitions. [2019-11-15 20:56:24,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:56:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 6364 transitions. [2019-11-15 20:56:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:56:24,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:24,554 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] [2019-11-15 20:56:24,554 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:24,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1234609342, now seen corresponding path program 1 times [2019-11-15 20:56:24,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:24,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762978473] [2019-11-15 20:56:24,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:24,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:24,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:24,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762978473] [2019-11-15 20:56:24,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:24,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:24,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739071206] [2019-11-15 20:56:24,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:24,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:24,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:24,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:24,674 INFO L87 Difference]: Start difference. First operand 2598 states and 6364 transitions. Second operand 6 states. [2019-11-15 20:56:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:24,776 INFO L93 Difference]: Finished difference Result 2927 states and 6970 transitions. [2019-11-15 20:56:24,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:56:24,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-15 20:56:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:24,779 INFO L225 Difference]: With dead ends: 2927 [2019-11-15 20:56:24,779 INFO L226 Difference]: Without dead ends: 2873 [2019-11-15 20:56:24,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2019-11-15 20:56:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2617. [2019-11-15 20:56:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2617 states. [2019-11-15 20:56:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 6337 transitions. [2019-11-15 20:56:24,799 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 6337 transitions. Word has length 91 [2019-11-15 20:56:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:24,799 INFO L462 AbstractCegarLoop]: Abstraction has 2617 states and 6337 transitions. [2019-11-15 20:56:24,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 6337 transitions. [2019-11-15 20:56:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:56:24,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:24,801 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] [2019-11-15 20:56:24,802 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1487666597, now seen corresponding path program 1 times [2019-11-15 20:56:24,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:24,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751774702] [2019-11-15 20:56:24,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:24,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:24,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:24,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751774702] [2019-11-15 20:56:24,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:24,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:56:24,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963540640] [2019-11-15 20:56:24,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:56:24,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:56:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:56:24,860 INFO L87 Difference]: Start difference. First operand 2617 states and 6337 transitions. Second operand 4 states. [2019-11-15 20:56:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:24,893 INFO L93 Difference]: Finished difference Result 2547 states and 6136 transitions. [2019-11-15 20:56:24,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:56:24,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 20:56:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:24,896 INFO L225 Difference]: With dead ends: 2547 [2019-11-15 20:56:24,896 INFO L226 Difference]: Without dead ends: 2547 [2019-11-15 20:56:24,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:56:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2019-11-15 20:56:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2351. [2019-11-15 20:56:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-15 20:56:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 5681 transitions. [2019-11-15 20:56:24,924 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 5681 transitions. Word has length 91 [2019-11-15 20:56:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:24,924 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 5681 transitions. [2019-11-15 20:56:24,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:56:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 5681 transitions. [2019-11-15 20:56:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:56:24,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:24,927 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] [2019-11-15 20:56:24,927 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:24,928 INFO L82 PathProgramCache]: Analyzing trace with hash -394012327, now seen corresponding path program 1 times [2019-11-15 20:56:24,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:24,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210498025] [2019-11-15 20:56:24,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:24,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:24,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:24,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210498025] [2019-11-15 20:56:24,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:24,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:56:24,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814948923] [2019-11-15 20:56:24,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:56:24,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:24,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:56:24,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:56:24,985 INFO L87 Difference]: Start difference. First operand 2351 states and 5681 transitions. Second operand 5 states. [2019-11-15 20:56:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:25,194 INFO L93 Difference]: Finished difference Result 2739 states and 6538 transitions. [2019-11-15 20:56:25,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:56:25,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-11-15 20:56:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:25,196 INFO L225 Difference]: With dead ends: 2739 [2019-11-15 20:56:25,196 INFO L226 Difference]: Without dead ends: 2717 [2019-11-15 20:56:25,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:56:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2019-11-15 20:56:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2398. [2019-11-15 20:56:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-11-15 20:56:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 5775 transitions. [2019-11-15 20:56:25,217 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 5775 transitions. Word has length 91 [2019-11-15 20:56:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:25,218 INFO L462 AbstractCegarLoop]: Abstraction has 2398 states and 5775 transitions. [2019-11-15 20:56:25,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:56:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 5775 transitions. [2019-11-15 20:56:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:56:25,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:25,219 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:25,219 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:25,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash 712926340, now seen corresponding path program 1 times [2019-11-15 20:56:25,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:25,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268924093] [2019-11-15 20:56:25,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:25,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:25,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:25,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268924093] [2019-11-15 20:56:25,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:25,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:56:25,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636682718] [2019-11-15 20:56:25,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:56:25,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:56:25,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:25,313 INFO L87 Difference]: Start difference. First operand 2398 states and 5775 transitions. Second operand 7 states. [2019-11-15 20:56:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:25,619 INFO L93 Difference]: Finished difference Result 4735 states and 11665 transitions. [2019-11-15 20:56:25,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:56:25,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-15 20:56:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:25,623 INFO L225 Difference]: With dead ends: 4735 [2019-11-15 20:56:25,623 INFO L226 Difference]: Without dead ends: 4735 [2019-11-15 20:56:25,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:56:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-11-15 20:56:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 2470. [2019-11-15 20:56:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-11-15 20:56:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 5945 transitions. [2019-11-15 20:56:25,653 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 5945 transitions. Word has length 91 [2019-11-15 20:56:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:25,653 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 5945 transitions. [2019-11-15 20:56:25,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:56:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 5945 transitions. [2019-11-15 20:56:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:56:25,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:25,655 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] [2019-11-15 20:56:25,655 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:25,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:25,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1957690821, now seen corresponding path program 2 times [2019-11-15 20:56:25,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:25,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607026215] [2019-11-15 20:56:25,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:25,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:25,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:25,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607026215] [2019-11-15 20:56:25,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:25,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:25,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116531991] [2019-11-15 20:56:25,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:25,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:25,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:25,784 INFO L87 Difference]: Start difference. First operand 2470 states and 5945 transitions. Second operand 6 states. [2019-11-15 20:56:25,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:25,836 INFO L93 Difference]: Finished difference Result 3946 states and 9690 transitions. [2019-11-15 20:56:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:56:25,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-15 20:56:25,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:25,841 INFO L225 Difference]: With dead ends: 3946 [2019-11-15 20:56:25,841 INFO L226 Difference]: Without dead ends: 3946 [2019-11-15 20:56:25,841 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-15 20:56:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-11-15 20:56:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 2482. [2019-11-15 20:56:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2019-11-15 20:56:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 5939 transitions. [2019-11-15 20:56:25,879 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 5939 transitions. Word has length 91 [2019-11-15 20:56:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:25,879 INFO L462 AbstractCegarLoop]: Abstraction has 2482 states and 5939 transitions. [2019-11-15 20:56:25,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 5939 transitions. [2019-11-15 20:56:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:56:25,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:25,882 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:25,882 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1856560059, now seen corresponding path program 1 times [2019-11-15 20:56:25,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:25,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829925665] [2019-11-15 20:56:25,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:25,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:25,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:25,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-15 20:56:25,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829925665] [2019-11-15 20:56:25,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:25,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:25,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896179484] [2019-11-15 20:56:25,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:25,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:25,970 INFO L87 Difference]: Start difference. First operand 2482 states and 5939 transitions. Second operand 6 states. [2019-11-15 20:56:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:26,121 INFO L93 Difference]: Finished difference Result 2257 states and 5261 transitions. [2019-11-15 20:56:26,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:56:26,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-15 20:56:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:26,124 INFO L225 Difference]: With dead ends: 2257 [2019-11-15 20:56:26,125 INFO L226 Difference]: Without dead ends: 2257 [2019-11-15 20:56:26,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:56:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2019-11-15 20:56:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1722. [2019-11-15 20:56:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-11-15 20:56:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 4078 transitions. [2019-11-15 20:56:26,192 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 4078 transitions. Word has length 91 [2019-11-15 20:56:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:26,192 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 4078 transitions. [2019-11-15 20:56:26,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 4078 transitions. [2019-11-15 20:56:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:26,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:26,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:26,195 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1243876582, now seen corresponding path program 1 times [2019-11-15 20:56:26,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:26,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533367006] [2019-11-15 20:56:26,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:26,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:26,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:26,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533367006] [2019-11-15 20:56:26,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:26,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:26,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075775954] [2019-11-15 20:56:26,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:26,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:26,275 INFO L87 Difference]: Start difference. First operand 1722 states and 4078 transitions. Second operand 6 states. [2019-11-15 20:56:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:26,575 INFO L93 Difference]: Finished difference Result 2057 states and 4762 transitions. [2019-11-15 20:56:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:56:26,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 20:56:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:26,578 INFO L225 Difference]: With dead ends: 2057 [2019-11-15 20:56:26,578 INFO L226 Difference]: Without dead ends: 2057 [2019-11-15 20:56:26,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2019-11-15 20:56:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1820. [2019-11-15 20:56:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-11-15 20:56:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4277 transitions. [2019-11-15 20:56:26,601 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4277 transitions. Word has length 93 [2019-11-15 20:56:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:26,601 INFO L462 AbstractCegarLoop]: Abstraction has 1820 states and 4277 transitions. [2019-11-15 20:56:26,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4277 transitions. [2019-11-15 20:56:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:26,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:26,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:26,603 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1573642343, now seen corresponding path program 1 times [2019-11-15 20:56:26,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:26,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773742860] [2019-11-15 20:56:26,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:26,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:26,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:26,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773742860] [2019-11-15 20:56:26,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:26,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:26,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389276534] [2019-11-15 20:56:26,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:26,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:26,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:26,718 INFO L87 Difference]: Start difference. First operand 1820 states and 4277 transitions. Second operand 6 states. [2019-11-15 20:56:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:26,863 INFO L93 Difference]: Finished difference Result 2011 states and 4637 transitions. [2019-11-15 20:56:26,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:56:26,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 20:56:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:26,866 INFO L225 Difference]: With dead ends: 2011 [2019-11-15 20:56:26,867 INFO L226 Difference]: Without dead ends: 2011 [2019-11-15 20:56:26,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:56:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-11-15 20:56:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1754. [2019-11-15 20:56:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2019-11-15 20:56:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4118 transitions. [2019-11-15 20:56:26,889 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4118 transitions. Word has length 93 [2019-11-15 20:56:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:26,889 INFO L462 AbstractCegarLoop]: Abstraction has 1754 states and 4118 transitions. [2019-11-15 20:56:26,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4118 transitions. [2019-11-15 20:56:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:26,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:26,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:26,891 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1943947111, now seen corresponding path program 1 times [2019-11-15 20:56:26,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:26,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134107142] [2019-11-15 20:56:26,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:26,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:26,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:26,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134107142] [2019-11-15 20:56:26,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:26,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:56:26,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478587908] [2019-11-15 20:56:26,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:56:26,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:26,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:56:26,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:26,983 INFO L87 Difference]: Start difference. First operand 1754 states and 4118 transitions. Second operand 7 states. [2019-11-15 20:56:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:27,540 INFO L93 Difference]: Finished difference Result 2919 states and 6743 transitions. [2019-11-15 20:56:27,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:56:27,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 20:56:27,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:27,544 INFO L225 Difference]: With dead ends: 2919 [2019-11-15 20:56:27,544 INFO L226 Difference]: Without dead ends: 2901 [2019-11-15 20:56:27,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:56:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2019-11-15 20:56:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2340. [2019-11-15 20:56:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2340 states. [2019-11-15 20:56:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 5487 transitions. [2019-11-15 20:56:27,575 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 5487 transitions. Word has length 93 [2019-11-15 20:56:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:27,575 INFO L462 AbstractCegarLoop]: Abstraction has 2340 states and 5487 transitions. [2019-11-15 20:56:27,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:56:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 5487 transitions. [2019-11-15 20:56:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:27,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:27,578 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:27,578 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1106255704, now seen corresponding path program 1 times [2019-11-15 20:56:27,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:27,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590623937] [2019-11-15 20:56:27,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:27,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:27,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:27,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590623937] [2019-11-15 20:56:27,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:27,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:27,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98468673] [2019-11-15 20:56:27,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:27,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:27,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:27,696 INFO L87 Difference]: Start difference. First operand 2340 states and 5487 transitions. Second operand 6 states. [2019-11-15 20:56:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:27,850 INFO L93 Difference]: Finished difference Result 2346 states and 5468 transitions. [2019-11-15 20:56:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:56:27,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 20:56:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:27,852 INFO L225 Difference]: With dead ends: 2346 [2019-11-15 20:56:27,852 INFO L226 Difference]: Without dead ends: 2346 [2019-11-15 20:56:27,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:56:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-11-15 20:56:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2258. [2019-11-15 20:56:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-11-15 20:56:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 5294 transitions. [2019-11-15 20:56:27,869 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 5294 transitions. Word has length 93 [2019-11-15 20:56:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:27,869 INFO L462 AbstractCegarLoop]: Abstraction has 2258 states and 5294 transitions. [2019-11-15 20:56:27,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 5294 transitions. [2019-11-15 20:56:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:27,871 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:27,871 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:27,871 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2021254424, now seen corresponding path program 1 times [2019-11-15 20:56:27,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:27,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345025025] [2019-11-15 20:56:27,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:27,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:27,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:27,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345025025] [2019-11-15 20:56:27,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:27,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:56:27,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195469519] [2019-11-15 20:56:27,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:56:27,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:56:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:56:27,954 INFO L87 Difference]: Start difference. First operand 2258 states and 5294 transitions. Second operand 5 states. [2019-11-15 20:56:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:28,141 INFO L93 Difference]: Finished difference Result 2510 states and 5873 transitions. [2019-11-15 20:56:28,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:56:28,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 20:56:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:28,143 INFO L225 Difference]: With dead ends: 2510 [2019-11-15 20:56:28,143 INFO L226 Difference]: Without dead ends: 2492 [2019-11-15 20:56:28,144 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-15 20:56:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2019-11-15 20:56:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2116. [2019-11-15 20:56:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-11-15 20:56:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 4953 transitions. [2019-11-15 20:56:28,161 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 4953 transitions. Word has length 93 [2019-11-15 20:56:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:28,161 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 4953 transitions. [2019-11-15 20:56:28,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:56:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 4953 transitions. [2019-11-15 20:56:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:28,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:28,163 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:28,163 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash -776489943, now seen corresponding path program 1 times [2019-11-15 20:56:28,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:28,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666351350] [2019-11-15 20:56:28,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:28,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:28,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:28,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666351350] [2019-11-15 20:56:28,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:28,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:56:28,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451068732] [2019-11-15 20:56:28,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:56:28,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:56:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:56:28,251 INFO L87 Difference]: Start difference. First operand 2116 states and 4953 transitions. Second operand 6 states. [2019-11-15 20:56:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:28,349 INFO L93 Difference]: Finished difference Result 2191 states and 5104 transitions. [2019-11-15 20:56:28,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:56:28,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 20:56:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:28,351 INFO L225 Difference]: With dead ends: 2191 [2019-11-15 20:56:28,351 INFO L226 Difference]: Without dead ends: 2191 [2019-11-15 20:56:28,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:56:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-11-15 20:56:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2098. [2019-11-15 20:56:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2019-11-15 20:56:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 4917 transitions. [2019-11-15 20:56:28,369 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 4917 transitions. Word has length 93 [2019-11-15 20:56:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:28,369 INFO L462 AbstractCegarLoop]: Abstraction has 2098 states and 4917 transitions. [2019-11-15 20:56:28,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:56:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 4917 transitions. [2019-11-15 20:56:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:28,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:28,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:28,371 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash 806204675, now seen corresponding path program 1 times [2019-11-15 20:56:28,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:28,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63613233] [2019-11-15 20:56:28,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:28,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:28,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:28,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63613233] [2019-11-15 20:56:28,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:28,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:56:28,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098885640] [2019-11-15 20:56:28,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:56:28,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:56:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:28,499 INFO L87 Difference]: Start difference. First operand 2098 states and 4917 transitions. Second operand 7 states. [2019-11-15 20:56:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:28,746 INFO L93 Difference]: Finished difference Result 2254 states and 5190 transitions. [2019-11-15 20:56:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:56:28,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 20:56:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:28,748 INFO L225 Difference]: With dead ends: 2254 [2019-11-15 20:56:28,748 INFO L226 Difference]: Without dead ends: 2210 [2019-11-15 20:56:28,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:56:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-11-15 20:56:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2074. [2019-11-15 20:56:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-11-15 20:56:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 4854 transitions. [2019-11-15 20:56:28,766 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 4854 transitions. Word has length 93 [2019-11-15 20:56:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:28,766 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 4854 transitions. [2019-11-15 20:56:28,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:56:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 4854 transitions. [2019-11-15 20:56:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:28,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:28,768 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:28,768 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash 357508036, now seen corresponding path program 1 times [2019-11-15 20:56:28,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:28,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839072019] [2019-11-15 20:56:28,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:28,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:28,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:28,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839072019] [2019-11-15 20:56:28,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:28,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:56:28,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957783509] [2019-11-15 20:56:28,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:56:28,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:28,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:56:28,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:56:28,898 INFO L87 Difference]: Start difference. First operand 2074 states and 4854 transitions. Second operand 7 states. [2019-11-15 20:56:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:29,008 INFO L93 Difference]: Finished difference Result 3472 states and 8195 transitions. [2019-11-15 20:56:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:56:29,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 20:56:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:29,010 INFO L225 Difference]: With dead ends: 3472 [2019-11-15 20:56:29,010 INFO L226 Difference]: Without dead ends: 1476 [2019-11-15 20:56:29,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:56:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-11-15 20:56:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1396. [2019-11-15 20:56:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-11-15 20:56:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 3309 transitions. [2019-11-15 20:56:29,027 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 3309 transitions. Word has length 93 [2019-11-15 20:56:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:29,027 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 3309 transitions. [2019-11-15 20:56:29,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:56:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 3309 transitions. [2019-11-15 20:56:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:29,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:29,029 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:29,030 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash -943421820, now seen corresponding path program 2 times [2019-11-15 20:56:29,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:29,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283713481] [2019-11-15 20:56:29,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:29,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:29,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:56:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:56:29,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283713481] [2019-11-15 20:56:29,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:56:29,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 20:56:29,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150875928] [2019-11-15 20:56:29,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:56:29,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:56:29,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:56:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:56:29,214 INFO L87 Difference]: Start difference. First operand 1396 states and 3309 transitions. Second operand 12 states. [2019-11-15 20:56:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:56:29,471 INFO L93 Difference]: Finished difference Result 2608 states and 6254 transitions. [2019-11-15 20:56:29,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:56:29,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-11-15 20:56:29,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:56:29,474 INFO L225 Difference]: With dead ends: 2608 [2019-11-15 20:56:29,474 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 20:56:29,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:56:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 20:56:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1857. [2019-11-15 20:56:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2019-11-15 20:56:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 4308 transitions. [2019-11-15 20:56:29,496 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 4308 transitions. Word has length 93 [2019-11-15 20:56:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:56:29,497 INFO L462 AbstractCegarLoop]: Abstraction has 1857 states and 4308 transitions. [2019-11-15 20:56:29,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:56:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 4308 transitions. [2019-11-15 20:56:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:56:29,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:56:29,499 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:56:29,499 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:56:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:56:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1394134806, now seen corresponding path program 3 times [2019-11-15 20:56:29,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:56:29,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97197562] [2019-11-15 20:56:29,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:29,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:56:29,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:56:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:56:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:56:29,615 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:56:29,616 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:56:29,788 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:56:29,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:56:29 BasicIcfg [2019-11-15 20:56:29,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:56:29,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:56:29,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:56:29,804 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:56:29,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:55:53" (3/4) ... [2019-11-15 20:56:29,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:56:29,945 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4ff85b04-3ffa-4c69-b437-17a1d93a16ef/bin/uautomizer/witness.graphml [2019-11-15 20:56:29,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:56:29,947 INFO L168 Benchmark]: Toolchain (without parser) took 38295.92 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 944.7 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-15 20:56:29,948 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:56:29,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:56:29,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:56:29,948 INFO L168 Benchmark]: Boogie Preprocessor took 35.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:56:29,949 INFO L168 Benchmark]: RCFGBuilder took 760.08 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: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:56:29,949 INFO L168 Benchmark]: TraceAbstraction took 36595.23 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 20:56:29,950 INFO L168 Benchmark]: Witness Printer took 145.00 ms. Allocated memory is still 4.1 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:56:29,951 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 699.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.36 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. * Boogie Preprocessor took 35.88 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 760.08 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: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36595.23 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 145.00 ms. Allocated memory is still 4.1 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L699] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L700] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L701] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L702] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L703] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L704] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L705] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L706] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L707] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L708] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L710] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L711] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L712] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 2 x$w_buff1 = x$w_buff0 [L741] 2 x$w_buff0 = 2 [L742] 2 x$w_buff1_used = x$w_buff0_used [L743] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L726] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L786] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 x = x$flush_delayed ? x$mem_tmp : x [L805] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 174 locations, 3 error locations. Result: UNSAFE, OverallTime: 36.4s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8926 SDtfs, 9418 SDslu, 20366 SDs, 0 SdLazy, 8236 SolverSat, 536 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 100 SyntacticMatches, 16 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71293occurred 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: 12.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 115789 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2779 NumberOfCodeBlocks, 2779 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2651 ConstructedInterpolants, 0 QuantifiedInterpolants, 543279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...