./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_25x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_25x0-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 59acfc6d5178664a3f2144603274c2b6e876292a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-28 00:26:09,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:26:09,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:26:09,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:26:09,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:26:09,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:26:09,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:26:09,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:26:09,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:26:09,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:26:09,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:26:09,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:26:09,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:26:09,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:26:09,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:26:09,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:26:09,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:26:09,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:26:09,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:26:09,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:26:09,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:26:09,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:26:09,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:26:09,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:26:09,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:26:09,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:26:09,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:26:09,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:26:09,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:26:09,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:26:09,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:26:09,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:26:09,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:26:09,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:26:09,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:26:09,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:26:09,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:26:09,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:26:09,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:26:09,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:26:09,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:26:09,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:26:09,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:26:09,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:26:09,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:26:09,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:26:09,773 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:26:09,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:26:09,773 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:26:09,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:26:09,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:26:09,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:26:09,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:26:09,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:26:09,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:26:09,777 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:26:09,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:26:09,777 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:26:09,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:26:09,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:26:09,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:26:09,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:26:09,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:26:09,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:26:09,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:26:09,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:26:09,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:26:09,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:26:09,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:26:09,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:26:09,781 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 59acfc6d5178664a3f2144603274c2b6e876292a [2019-11-28 00:26:10,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:26:10,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:26:10,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:26:10,092 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:26:10,092 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:26:10,093 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2019-11-28 00:26:10,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06e821f50/9c817cfb6821423d895a7a8f47581066/FLAGff29d6c5b [2019-11-28 00:26:10,676 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:26:10,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2019-11-28 00:26:10,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06e821f50/9c817cfb6821423d895a7a8f47581066/FLAGff29d6c5b [2019-11-28 00:26:11,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06e821f50/9c817cfb6821423d895a7a8f47581066 [2019-11-28 00:26:11,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:26:11,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:26:11,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:26:11,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:26:11,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:26:11,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318a92e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11, skipping insertion in model container [2019-11-28 00:26:11,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:26:11,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:26:11,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:26:11,400 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:26:11,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:26:11,435 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:26:11,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11 WrapperNode [2019-11-28 00:26:11,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:26:11,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:26:11,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:26:11,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:26:11,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:26:11,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:26:11,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:26:11,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:26:11,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... [2019-11-28 00:26:11,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:26:11,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:26:11,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:26:11,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:26:11,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 00:26:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:26:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:26:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-11-28 00:26:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-11-28 00:26:11,770 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:26:11,770 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:26:11,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:11 BoogieIcfgContainer [2019-11-28 00:26:11,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:26:11,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:26:11,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:26:11,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:26:11,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:26:11" (1/3) ... [2019-11-28 00:26:11,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf12739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:11, skipping insertion in model container [2019-11-28 00:26:11,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:11" (2/3) ... [2019-11-28 00:26:11,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf12739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:11, skipping insertion in model container [2019-11-28 00:26:11,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:11" (3/3) ... [2019-11-28 00:26:11,779 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2019-11-28 00:26:11,787 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:26:11,792 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:26:11,802 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:26:11,825 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:26:11,825 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:26:11,825 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:26:11,825 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:26:11,826 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:26:11,826 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:26:11,826 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:26:11,826 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:26:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-28 00:26:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:26:11,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:11,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:11,847 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:11,852 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-28 00:26:11,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:11,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820915969] [2019-11-28 00:26:11,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,144 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-28 00:26:12,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820915969] [2019-11-28 00:26:12,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:12,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:26:12,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808030797] [2019-11-28 00:26:12,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:26:12,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:12,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:26:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:26:12,199 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-28 00:26:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:12,336 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 00:26:12,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:26:12,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 00:26:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:12,347 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:26:12,347 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 00:26:12,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:26:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 00:26:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 00:26:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 00:26:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 00:26:12,383 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-28 00:26:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:12,384 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 00:26:12,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:26:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-28 00:26:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:26:12,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:12,386 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:12,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:12,386 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-28 00:26:12,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:12,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643796734] [2019-11-28 00:26:12,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:26:12,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643796734] [2019-11-28 00:26:12,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884503319] [2019-11-28 00:26:12,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:26:12,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:26:12,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:12,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 00:26:12,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702440379] [2019-11-28 00:26:12,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:26:12,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:26:12,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:26:12,707 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-11-28 00:26:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:12,829 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 00:26:12,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:26:12,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-28 00:26:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:12,832 INFO L225 Difference]: With dead ends: 21 [2019-11-28 00:26:12,832 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:26:12,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:26:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:26:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:26:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:26:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 00:26:12,846 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-28 00:26:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:12,848 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 00:26:12,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:26:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 00:26:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 00:26:12,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:12,854 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:13,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:13,058 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-28 00:26:13,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:13,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255014462] [2019-11-28 00:26:13,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:26:13,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255014462] [2019-11-28 00:26:13,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41229163] [2019-11-28 00:26:13,283 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:13,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:13,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:13,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:26:13,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:26:13,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:13,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-28 00:26:13,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106520518] [2019-11-28 00:26:13,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:26:13,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:13,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:26:13,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:26:13,369 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-11-28 00:26:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:13,476 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 00:26:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:26:13,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-28 00:26:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:13,478 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:26:13,479 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 00:26:13,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:26:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 00:26:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 00:26:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:26:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 00:26:13,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-28 00:26:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:13,492 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 00:26:13,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:26:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 00:26:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:26:13,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:13,497 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:13,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:13,709 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:13,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:13,710 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-28 00:26:13,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:13,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014138973] [2019-11-28 00:26:13,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:26:13,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014138973] [2019-11-28 00:26:13,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458813570] [2019-11-28 00:26:13,952 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:13,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 00:26:13,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:13,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:26:13,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:26:14,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:14,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-11-28 00:26:14,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180092339] [2019-11-28 00:26:14,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:26:14,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:14,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:26:14,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:26:14,028 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-11-28 00:26:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:14,128 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 00:26:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:26:14,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-28 00:26:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:14,130 INFO L225 Difference]: With dead ends: 27 [2019-11-28 00:26:14,130 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 00:26:14,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:26:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 00:26:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 00:26:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 00:26:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 00:26:14,138 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-28 00:26:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:14,138 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 00:26:14,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:26:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 00:26:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:26:14,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:14,140 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:14,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:14,345 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:14,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-28 00:26:14,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:14,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446431332] [2019-11-28 00:26:14,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 00:26:14,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446431332] [2019-11-28 00:26:14,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075622781] [2019-11-28 00:26:14,597 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:14,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:14,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:14,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:26:14,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 00:26:14,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:14,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-28 00:26:14,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524179134] [2019-11-28 00:26:14,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:26:14,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:26:14,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:26:14,689 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-11-28 00:26:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:14,810 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 00:26:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:26:14,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-28 00:26:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:14,812 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:26:14,812 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:26:14,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:26:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:26:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:26:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:26:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 00:26:14,820 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-28 00:26:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:14,820 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 00:26:14,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:26:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 00:26:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:26:14,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:14,823 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:15,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:15,036 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-28 00:26:15,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:15,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427270758] [2019-11-28 00:26:15,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 00:26:15,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427270758] [2019-11-28 00:26:15,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40205908] [2019-11-28 00:26:15,248 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:15,297 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 00:26:15,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:15,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 00:26:15,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 00:26:15,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:15,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2019-11-28 00:26:15,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071736598] [2019-11-28 00:26:15,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 00:26:15,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:15,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 00:26:15,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:26:15,341 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-11-28 00:26:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:15,459 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 00:26:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:26:15,460 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-28 00:26:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:15,462 INFO L225 Difference]: With dead ends: 33 [2019-11-28 00:26:15,463 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 00:26:15,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:26:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 00:26:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 00:26:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 00:26:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 00:26:15,475 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-28 00:26:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:15,477 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 00:26:15,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 00:26:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 00:26:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:26:15,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:15,480 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:15,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:15,684 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-28 00:26:15,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:15,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413442004] [2019-11-28 00:26:15,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 00:26:15,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413442004] [2019-11-28 00:26:15,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705500288] [2019-11-28 00:26:15,986 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:16,043 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 00:26:16,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:16,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:26:16,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 00:26:16,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:16,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-28 00:26:16,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023961821] [2019-11-28 00:26:16,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:26:16,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:26:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:26:16,122 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-11-28 00:26:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:16,257 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-28 00:26:16,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 00:26:16,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-11-28 00:26:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:16,258 INFO L225 Difference]: With dead ends: 36 [2019-11-28 00:26:16,258 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 00:26:16,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:26:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 00:26:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 00:26:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 00:26:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-28 00:26:16,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-28 00:26:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:16,271 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-28 00:26:16,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:26:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-28 00:26:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:26:16,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:16,275 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:16,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:16,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-28 00:26:16,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:16,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990724475] [2019-11-28 00:26:16,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 00:26:16,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990724475] [2019-11-28 00:26:16,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417341779] [2019-11-28 00:26:16,778 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 00:26:16,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 00:26:16,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:16,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2019-11-28 00:26:16,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733093134] [2019-11-28 00:26:16,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:26:16,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:26:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:26:16,939 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2019-11-28 00:26:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:17,105 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 00:26:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:26:17,106 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-28 00:26:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:17,107 INFO L225 Difference]: With dead ends: 39 [2019-11-28 00:26:17,107 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:26:17,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:26:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:26:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 00:26:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 00:26:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 00:26:17,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-28 00:26:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:17,115 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 00:26:17,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:26:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 00:26:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 00:26:17,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:17,117 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:17,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:17,318 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-28 00:26:17,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:17,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087964894] [2019-11-28 00:26:17,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 00:26:17,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087964894] [2019-11-28 00:26:17,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248090467] [2019-11-28 00:26:17,620 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:17,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:17,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:17,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:26:17,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 00:26:17,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:17,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2019-11-28 00:26:17,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700560569] [2019-11-28 00:26:17,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:26:17,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:26:17,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:26:17,743 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 16 states. [2019-11-28 00:26:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:17,912 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 00:26:17,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:26:17,913 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-11-28 00:26:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:17,915 INFO L225 Difference]: With dead ends: 42 [2019-11-28 00:26:17,915 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 00:26:17,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:26:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 00:26:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 00:26:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:26:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 00:26:17,922 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-28 00:26:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:17,923 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 00:26:17,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:26:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 00:26:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:26:17,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:17,925 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:18,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:18,126 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-28 00:26:18,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:18,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943247933] [2019-11-28 00:26:18,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 00:26:18,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943247933] [2019-11-28 00:26:18,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904719590] [2019-11-28 00:26:18,442 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:18,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 00:26:18,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:18,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 00:26:18,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 00:26:18,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:18,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-11-28 00:26:18,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449492367] [2019-11-28 00:26:18,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 00:26:18,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:18,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 00:26:18,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:26:18,564 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 17 states. [2019-11-28 00:26:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:18,754 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 00:26:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:26:18,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-11-28 00:26:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:18,759 INFO L225 Difference]: With dead ends: 45 [2019-11-28 00:26:18,759 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 00:26:18,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2019-11-28 00:26:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 00:26:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 00:26:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:26:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 00:26:18,774 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-28 00:26:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:18,774 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 00:26:18,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 00:26:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 00:26:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:26:18,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:18,777 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:18,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:18,980 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-28 00:26:18,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:18,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672364237] [2019-11-28 00:26:18,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 00:26:19,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672364237] [2019-11-28 00:26:19,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737609138] [2019-11-28 00:26:19,352 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:19,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:19,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:19,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 00:26:19,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 00:26:19,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:19,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2019-11-28 00:26:19,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944727712] [2019-11-28 00:26:19,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:26:19,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:19,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:26:19,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:26:19,446 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 18 states. [2019-11-28 00:26:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:19,621 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-28 00:26:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:26:19,621 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-11-28 00:26:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:19,623 INFO L225 Difference]: With dead ends: 48 [2019-11-28 00:26:19,623 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 00:26:19,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2019-11-28 00:26:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 00:26:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-28 00:26:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 00:26:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-28 00:26:19,630 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-28 00:26:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:19,631 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-28 00:26:19,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:26:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-28 00:26:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:26:19,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:19,632 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:19,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:19,837 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:19,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:19,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-28 00:26:19,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:19,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510651084] [2019-11-28 00:26:19,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 00:26:20,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510651084] [2019-11-28 00:26:20,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508283271] [2019-11-28 00:26:20,256 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:20,325 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 00:26:20,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:20,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:26:20,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 00:26:20,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:20,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 19 [2019-11-28 00:26:20,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256443790] [2019-11-28 00:26:20,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:26:20,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:26:20,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:26:20,377 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 19 states. [2019-11-28 00:26:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:20,580 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-28 00:26:20,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:26:20,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-11-28 00:26:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:20,582 INFO L225 Difference]: With dead ends: 51 [2019-11-28 00:26:20,582 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:26:20,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2019-11-28 00:26:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:26:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:26:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:26:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-28 00:26:20,597 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-28 00:26:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:20,598 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-28 00:26:20,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:26:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-28 00:26:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:26:20,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:20,599 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:20,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:20,804 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-28 00:26:20,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:20,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300104753] [2019-11-28 00:26:20,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 00:26:21,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300104753] [2019-11-28 00:26:21,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883780957] [2019-11-28 00:26:21,281 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:21,385 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 00:26:21,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:21,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 00:26:21,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 00:26:21,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:21,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2019-11-28 00:26:21,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156469939] [2019-11-28 00:26:21,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:26:21,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:21,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:26:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:26:21,447 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 20 states. [2019-11-28 00:26:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:21,711 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 00:26:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:26:21,712 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2019-11-28 00:26:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:21,713 INFO L225 Difference]: With dead ends: 54 [2019-11-28 00:26:21,713 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:26:21,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=719, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 00:26:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:26:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 00:26:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:26:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 00:26:21,731 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-28 00:26:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:21,732 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 00:26:21,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:26:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 00:26:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 00:26:21,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:21,734 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:21,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:21,949 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-28 00:26:21,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:21,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707400833] [2019-11-28 00:26:21,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 00:26:22,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707400833] [2019-11-28 00:26:22,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611153436] [2019-11-28 00:26:22,406 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 00:26:22,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 00:26:22,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:22,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 21 [2019-11-28 00:26:22,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091740354] [2019-11-28 00:26:22,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 00:26:22,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:22,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 00:26:22,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:26:22,513 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2019-11-28 00:26:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:22,735 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 00:26:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:26:22,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-28 00:26:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:22,737 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:26:22,737 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 00:26:22,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 00:26:22,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 00:26:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 00:26:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:26:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 00:26:22,743 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-28 00:26:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:22,744 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 00:26:22,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 00:26:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 00:26:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 00:26:22,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:22,745 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:22,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:22,950 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:22,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-28 00:26:22,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:22,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266146915] [2019-11-28 00:26:22,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 00:26:23,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266146915] [2019-11-28 00:26:23,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978000724] [2019-11-28 00:26:23,514 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:23,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:23,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:23,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 00:26:23,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 00:26:23,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:23,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2019-11-28 00:26:23,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544206990] [2019-11-28 00:26:23,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:26:23,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:23,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:26:23,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:26:23,653 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2019-11-28 00:26:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:23,907 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-28 00:26:23,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:26:23,908 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-11-28 00:26:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:23,909 INFO L225 Difference]: With dead ends: 60 [2019-11-28 00:26:23,909 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 00:26:23,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=900, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 00:26:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 00:26:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 00:26:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:26:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-28 00:26:23,925 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-28 00:26:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:23,926 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-28 00:26:23,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:26:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-28 00:26:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 00:26:23,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:23,929 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:24,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:24,144 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-28 00:26:24,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:24,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507220792] [2019-11-28 00:26:24,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-28 00:26:24,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507220792] [2019-11-28 00:26:24,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651613561] [2019-11-28 00:26:24,656 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:24,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-28 00:26:24,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:24,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 00:26:24,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-28 00:26:24,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:24,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2019-11-28 00:26:24,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016257044] [2019-11-28 00:26:24,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 00:26:24,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 00:26:24,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:26:24,781 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 23 states. [2019-11-28 00:26:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:25,032 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-28 00:26:25,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 00:26:25,033 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2019-11-28 00:26:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:25,033 INFO L225 Difference]: With dead ends: 63 [2019-11-28 00:26:25,033 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 00:26:25,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=998, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 00:26:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 00:26:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 00:26:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 00:26:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-28 00:26:25,039 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-28 00:26:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:25,040 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-28 00:26:25,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 00:26:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-28 00:26:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 00:26:25,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:25,041 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:25,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:25,246 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-28 00:26:25,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:25,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274074097] [2019-11-28 00:26:25,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-28 00:26:25,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274074097] [2019-11-28 00:26:25,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24265036] [2019-11-28 00:26:25,902 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:25,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:25,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:25,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 00:26:25,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-28 00:26:26,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:26,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2019-11-28 00:26:26,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405258590] [2019-11-28 00:26:26,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 00:26:26,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 00:26:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:26:26,009 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 24 states. [2019-11-28 00:26:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:26,309 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-28 00:26:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 00:26:26,309 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2019-11-28 00:26:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:26,310 INFO L225 Difference]: With dead ends: 66 [2019-11-28 00:26:26,310 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 00:26:26,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=539, Invalid=1101, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 00:26:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 00:26:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-28 00:26:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 00:26:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-28 00:26:26,317 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-28 00:26:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:26,318 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-28 00:26:26,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 00:26:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-28 00:26:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 00:26:26,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:26,319 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:26,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:26,528 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-28 00:26:26,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:26,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26069238] [2019-11-28 00:26:26,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-28 00:26:27,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26069238] [2019-11-28 00:26:27,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423294850] [2019-11-28 00:26:27,224 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:27,333 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-28 00:26:27,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:27,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 00:26:27,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-28 00:26:27,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:27,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2019-11-28 00:26:27,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005149623] [2019-11-28 00:26:27,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:26:27,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:27,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:26:27,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:26:27,398 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 25 states. [2019-11-28 00:26:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:27,698 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-28 00:26:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 00:26:27,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 111 [2019-11-28 00:26:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:27,701 INFO L225 Difference]: With dead ends: 69 [2019-11-28 00:26:27,702 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 00:26:27,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=597, Invalid=1209, Unknown=0, NotChecked=0, Total=1806 [2019-11-28 00:26:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 00:26:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 00:26:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 00:26:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-28 00:26:27,713 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-28 00:26:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:27,713 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-28 00:26:27,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:26:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-28 00:26:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 00:26:27,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:27,716 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:27,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:27,920 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:27,921 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-28 00:26:27,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:27,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422281313] [2019-11-28 00:26:27,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-28 00:26:28,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422281313] [2019-11-28 00:26:28,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862419916] [2019-11-28 00:26:28,650 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:28,714 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-28 00:26:28,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:28,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 00:26:28,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-28 00:26:28,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:28,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2019-11-28 00:26:28,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828076579] [2019-11-28 00:26:28,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 00:26:28,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 00:26:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:26:28,774 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 26 states. [2019-11-28 00:26:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:29,155 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-28 00:26:29,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 00:26:29,155 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2019-11-28 00:26:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:29,156 INFO L225 Difference]: With dead ends: 72 [2019-11-28 00:26:29,157 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:26:29,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=658, Invalid=1322, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 00:26:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:26:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 00:26:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 00:26:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-28 00:26:29,169 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-28 00:26:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:29,169 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-28 00:26:29,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 00:26:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-28 00:26:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-28 00:26:29,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:29,171 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:29,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:29,375 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:29,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:29,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-28 00:26:29,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:29,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982316689] [2019-11-28 00:26:29,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-28 00:26:30,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982316689] [2019-11-28 00:26:30,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795627690] [2019-11-28 00:26:30,321 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:30,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 00:26:30,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-28 00:26:30,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 27 [2019-11-28 00:26:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334130590] [2019-11-28 00:26:30,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 00:26:30,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:30,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 00:26:30,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-28 00:26:30,492 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 27 states. [2019-11-28 00:26:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:30,822 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-28 00:26:30,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 00:26:30,823 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2019-11-28 00:26:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:30,824 INFO L225 Difference]: With dead ends: 75 [2019-11-28 00:26:30,824 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:26:30,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=722, Invalid=1440, Unknown=0, NotChecked=0, Total=2162 [2019-11-28 00:26:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:26:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:26:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:26:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-28 00:26:30,831 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-28 00:26:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:30,831 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-28 00:26:30,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 00:26:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-28 00:26:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 00:26:30,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:30,833 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:31,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:31,034 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-28 00:26:31,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:31,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920748259] [2019-11-28 00:26:31,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-28 00:26:31,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920748259] [2019-11-28 00:26:31,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243090630] [2019-11-28 00:26:31,882 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:31,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:31,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:31,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-28 00:26:31,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-28 00:26:32,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:32,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 28 [2019-11-28 00:26:32,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060669910] [2019-11-28 00:26:32,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:26:32,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:32,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:26:32,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=492, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:26:32,018 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 28 states. [2019-11-28 00:26:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:32,362 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-11-28 00:26:32,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 00:26:32,363 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 129 [2019-11-28 00:26:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:32,366 INFO L225 Difference]: With dead ends: 78 [2019-11-28 00:26:32,366 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 00:26:32,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=789, Invalid=1563, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 00:26:32,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 00:26:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 00:26:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 00:26:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-11-28 00:26:32,371 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-11-28 00:26:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:32,372 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-11-28 00:26:32,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:26:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-11-28 00:26:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-28 00:26:32,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:32,373 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:32,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:32,583 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:32,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:32,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-11-28 00:26:32,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:32,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271326896] [2019-11-28 00:26:32,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-28 00:26:33,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271326896] [2019-11-28 00:26:33,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811977231] [2019-11-28 00:26:33,468 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:33,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-11-28 00:26:33,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:33,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-28 00:26:33,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-28 00:26:33,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:33,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2019-11-28 00:26:33,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716819292] [2019-11-28 00:26:33,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 00:26:33,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 00:26:33,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2019-11-28 00:26:33,638 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 29 states. [2019-11-28 00:26:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:33,993 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-11-28 00:26:33,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 00:26:33,994 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 135 [2019-11-28 00:26:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:33,995 INFO L225 Difference]: With dead ends: 81 [2019-11-28 00:26:33,995 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 00:26:33,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=859, Invalid=1691, Unknown=0, NotChecked=0, Total=2550 [2019-11-28 00:26:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 00:26:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-28 00:26:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 00:26:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-11-28 00:26:34,002 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-11-28 00:26:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:34,003 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-11-28 00:26:34,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 00:26:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-11-28 00:26:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 00:26:34,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:34,005 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:34,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:34,206 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:34,206 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-11-28 00:26:34,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:34,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875785668] [2019-11-28 00:26:34,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-28 00:26:35,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875785668] [2019-11-28 00:26:35,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935687536] [2019-11-28 00:26:35,506 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:35,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:35,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:35,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-28 00:26:35,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-28 00:26:35,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:35,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 30 [2019-11-28 00:26:35,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230717145] [2019-11-28 00:26:35,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 00:26:35,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 00:26:35,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:26:35,645 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 30 states. [2019-11-28 00:26:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:36,027 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-28 00:26:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 00:26:36,028 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 141 [2019-11-28 00:26:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:36,030 INFO L225 Difference]: With dead ends: 84 [2019-11-28 00:26:36,030 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:26:36,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=932, Invalid=1824, Unknown=0, NotChecked=0, Total=2756 [2019-11-28 00:26:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:26:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 00:26:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 00:26:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-11-28 00:26:36,037 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-11-28 00:26:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:36,037 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-11-28 00:26:36,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 00:26:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-11-28 00:26:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-28 00:26:36,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:36,039 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:36,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:36,243 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:36,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-11-28 00:26:36,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:36,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374193019] [2019-11-28 00:26:36,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-28 00:26:37,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374193019] [2019-11-28 00:26:37,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505384215] [2019-11-28 00:26:37,287 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:37,376 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-28 00:26:37,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:37,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-28 00:26:37,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-28 00:26:37,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:37,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 31 [2019-11-28 00:26:37,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231088506] [2019-11-28 00:26:37,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 00:26:37,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 00:26:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=594, Unknown=0, NotChecked=0, Total=930 [2019-11-28 00:26:37,464 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 31 states. [2019-11-28 00:26:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:37,836 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-11-28 00:26:37,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 00:26:37,836 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2019-11-28 00:26:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:37,838 INFO L225 Difference]: With dead ends: 87 [2019-11-28 00:26:37,838 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:26:37,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1008, Invalid=1962, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 00:26:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:26:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 00:26:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 00:26:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-11-28 00:26:37,844 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-11-28 00:26:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:37,844 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-11-28 00:26:37,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 00:26:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-11-28 00:26:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-28 00:26:37,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:37,845 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:38,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:38,049 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:38,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:38,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-11-28 00:26:38,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:38,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015970467] [2019-11-28 00:26:38,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-28 00:26:39,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015970467] [2019-11-28 00:26:39,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600831837] [2019-11-28 00:26:39,192 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:39,277 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-11-28 00:26:39,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:39,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-28 00:26:39,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-28 00:26:39,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:39,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2019-11-28 00:26:39,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503175957] [2019-11-28 00:26:39,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 00:26:39,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:39,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 00:26:39,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:26:39,365 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 32 states. [2019-11-28 00:26:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:39,810 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-11-28 00:26:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 00:26:39,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 153 [2019-11-28 00:26:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:39,812 INFO L225 Difference]: With dead ends: 90 [2019-11-28 00:26:39,812 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 00:26:39,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1087, Invalid=2105, Unknown=0, NotChecked=0, Total=3192 [2019-11-28 00:26:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 00:26:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-28 00:26:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 00:26:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-11-28 00:26:39,819 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-11-28 00:26:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:39,820 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-11-28 00:26:39,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 00:26:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-11-28 00:26:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-28 00:26:39,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:39,821 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:40,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:40,025 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-11-28 00:26:40,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:40,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455677625] [2019-11-28 00:26:40,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:26:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:26:40,107 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:26:40,108 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:26:40,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:40 BoogieIcfgContainer [2019-11-28 00:26:40,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:26:40,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:26:40,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:26:40,168 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:26:40,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:11" (3/4) ... [2019-11-28 00:26:40,171 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:26:40,234 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:26:40,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:26:40,236 INFO L168 Benchmark]: Toolchain (without parser) took 29143.80 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 725.1 MB). Free memory was 956.3 MB in the beginning and 1.5 GB in the end (delta: -501.9 MB). Peak memory consumption was 223.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:40,237 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:40,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.78 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:40,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:40,238 INFO L168 Benchmark]: Boogie Preprocessor took 15.84 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-28 00:26:40,239 INFO L168 Benchmark]: RCFGBuilder took 223.78 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:40,239 INFO L168 Benchmark]: TraceAbstraction took 28394.27 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 587.7 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -341.6 MB). Peak memory consumption was 246.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:40,239 INFO L168 Benchmark]: Witness Printer took 66.77 ms. Allocated memory is still 1.8 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:40,242 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.78 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.84 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 223.78 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28394.27 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 587.7 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -341.6 MB). Peak memory consumption was 246.1 MB. Max. memory is 11.5 GB. * Witness Printer took 66.77 ms. Allocated memory is still 1.8 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 28.2s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 202 SDtfs, 1131 SDslu, 1350 SDs, 0 SdLazy, 1561 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3392 GetRequests, 2618 SyntacticMatches, 0 SemanticMatches, 774 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5200 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 4200 NumberOfCodeBlocks, 4200 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105472 SizeOfPredicates, 348 NumberOfNonLiveVariables, 6096 ConjunctsInSsa, 696 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 15000/30000 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...