./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id_i25_o25_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/recursive-simple/id_i25_o25_false-unreach-call_true-termination.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 a544811fe2a74801350302afc46fb67e1c6f238a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-12 14:59:13,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:59:13,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:59:14,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:59:14,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:59:14,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:59:14,011 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:59:14,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:59:14,014 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:59:14,015 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:59:14,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:59:14,016 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:59:14,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:59:14,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:59:14,021 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:59:14,021 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:59:14,022 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:59:14,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:59:14,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:59:14,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:59:14,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:59:14,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:59:14,033 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:59:14,033 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:59:14,033 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:59:14,034 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:59:14,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:59:14,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:59:14,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:59:14,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:59:14,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:59:14,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:59:14,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:59:14,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:59:14,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:59:14,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:59:14,042 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:59:14,059 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:59:14,059 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:59:14,060 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:59:14,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:59:14,062 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:59:14,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:59:14,063 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:59:14,063 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:59:14,063 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:59:14,063 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:59:14,064 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:59:14,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:59:14,064 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:59:14,064 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:59:14,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:59:14,065 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:59:14,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:59:14,065 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:59:14,065 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:59:14,065 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:59:14,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:59:14,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:59:14,066 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:59:14,066 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:59:14,066 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:59:14,066 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:59:14,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:59:14,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:59:14,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> a544811fe2a74801350302afc46fb67e1c6f238a [2019-01-12 14:59:14,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:59:14,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:59:14,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:59:14,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:59:14,143 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:59:14,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id_i25_o25_false-unreach-call_true-termination.c [2019-01-12 14:59:14,210 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81607403/16644f1c92eb4380a3b9e8f4046bdecd/FLAG9a03ca6d6 [2019-01-12 14:59:14,656 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:59:14,659 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id_i25_o25_false-unreach-call_true-termination.c [2019-01-12 14:59:14,665 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81607403/16644f1c92eb4380a3b9e8f4046bdecd/FLAG9a03ca6d6 [2019-01-12 14:59:15,028 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81607403/16644f1c92eb4380a3b9e8f4046bdecd [2019-01-12 14:59:15,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:59:15,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:59:15,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:59:15,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:59:15,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:59:15,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b887ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15, skipping insertion in model container [2019-01-12 14:59:15,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:59:15,066 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:59:15,273 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:59:15,278 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:59:15,295 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:59:15,309 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:59:15,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15 WrapperNode [2019-01-12 14:59:15,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:59:15,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:59:15,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:59:15,311 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:59:15,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:59:15,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:59:15,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:59:15,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:59:15,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (1/1) ... [2019-01-12 14:59:15,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:59:15,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:59:15,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:59:15,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:59:15,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (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-01-12 14:59:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:59:15,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:59:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 14:59:15,488 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 14:59:15,664 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:59:15,665 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:59:15,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:59:15 BoogieIcfgContainer [2019-01-12 14:59:15,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:59:15,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:59:15,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:59:15,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:59:15,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:59:15" (1/3) ... [2019-01-12 14:59:15,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0d0c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:59:15, skipping insertion in model container [2019-01-12 14:59:15,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:15" (2/3) ... [2019-01-12 14:59:15,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0d0c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:59:15, skipping insertion in model container [2019-01-12 14:59:15,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:59:15" (3/3) ... [2019-01-12 14:59:15,673 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i25_o25_false-unreach-call_true-termination.c [2019-01-12 14:59:15,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:59:15,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:59:15,700 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:59:15,731 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:59:15,732 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:59:15,732 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:59:15,732 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:59:15,732 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:59:15,733 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:59:15,733 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:59:15,733 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:59:15,733 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:59:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 14:59:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:59:15,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:15,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:15,771 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 14:59:15,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:15,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:15,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:15,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:59:16,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:59:16,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:59:16,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:59:16,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:59:16,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:59:16,100 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 14:59:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:16,251 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 14:59:16,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:59:16,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:59:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:16,265 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:59:16,265 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 14:59:16,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:59:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 14:59:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 14:59:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 14:59:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 14:59:16,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 14:59:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:16,312 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 14:59:16,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:59:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 14:59:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 14:59:16,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:16,315 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:16,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:16,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:16,319 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 14:59:16,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:16,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:16,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:16,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:16,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:59:16,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:16,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:16,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:16,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:59:16,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:59:16,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:59:16,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:59:16,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:59:16,570 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 14:59:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:16,784 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 14:59:16,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:59:16,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 14:59:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:16,787 INFO L225 Difference]: With dead ends: 21 [2019-01-12 14:59:16,787 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 14:59:16,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:59:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 14:59:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 14:59:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:59:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 14:59:16,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 14:59:16,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:16,798 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 14:59:16,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:59:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 14:59:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 14:59:16,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:16,800 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:16,800 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 14:59:16,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:16,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:16,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:16,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:59:17,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:17,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:17,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:17,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:17,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:17,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:59:17,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:17,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:59:17,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:59:17,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:59:17,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:59:17,161 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 14:59:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:17,275 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 14:59:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:59:17,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 14:59:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:17,279 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:59:17,279 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 14:59:17,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:59:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 14:59:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 14:59:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 14:59:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 14:59:17,286 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 14:59:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:17,287 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 14:59:17,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:59:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 14:59:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:59:17,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:17,288 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:17,289 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 14:59:17,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:17,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:17,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:17,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:17,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:59:17,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:17,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:17,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:17,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 14:59:17,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:17,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:59:18,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:18,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-01-12 14:59:18,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:59:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:59:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:59:18,141 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2019-01-12 14:59:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:18,439 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 14:59:18,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:59:18,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-12 14:59:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:18,443 INFO L225 Difference]: With dead ends: 27 [2019-01-12 14:59:18,443 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 14:59:18,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:59:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 14:59:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 14:59:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 14:59:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 14:59:18,451 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 14:59:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:18,451 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 14:59:18,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:59:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 14:59:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:59:18,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:18,453 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:18,453 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 14:59:18,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:18,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:18,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 14:59:18,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:18,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:18,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:18,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:18,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:18,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 14:59:18,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:18,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 14:59:18,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:59:18,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:59:18,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:59:18,690 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 14:59:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:18,897 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 14:59:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:59:18,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 14:59:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:18,901 INFO L225 Difference]: With dead ends: 30 [2019-01-12 14:59:18,902 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 14:59:18,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:59:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 14:59:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 14:59:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:59:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 14:59:18,909 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 14:59:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:18,909 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 14:59:18,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:59:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 14:59:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 14:59:18,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:18,911 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:18,911 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 14:59:18,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:18,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:18,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 14:59:19,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:19,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:19,157 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:19,183 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 14:59:19,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:19,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 14:59:19,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:19,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2019-01-12 14:59:19,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:59:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:59:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:59:19,436 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2019-01-12 14:59:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:19,781 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 14:59:19,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:59:19,781 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-01-12 14:59:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:19,783 INFO L225 Difference]: With dead ends: 33 [2019-01-12 14:59:19,783 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 14:59:19,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 14:59:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 14:59:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 14:59:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 14:59:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 14:59:19,791 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 14:59:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:19,791 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 14:59:19,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:59:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 14:59:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 14:59:19,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:19,795 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:19,795 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 14:59:19,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:19,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:19,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:19,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:19,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 14:59:20,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:20,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:20,092 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 14:59:20,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:20,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 14:59:20,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:20,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 14:59:20,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:59:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:59:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:59:20,146 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 17 states. [2019-01-12 14:59:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:20,329 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 14:59:20,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 14:59:20,330 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-01-12 14:59:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:20,332 INFO L225 Difference]: With dead ends: 36 [2019-01-12 14:59:20,332 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 14:59:20,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:59:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 14:59:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 14:59:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 14:59:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 14:59:20,340 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 14:59:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:20,341 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 14:59:20,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:59:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 14:59:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:59:20,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:20,344 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:20,344 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:20,344 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 14:59:20,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:20,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:20,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:20,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 14:59:20,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:20,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:20,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:20,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 14:59:20,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:20,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2019-01-12 14:59:20,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 14:59:20,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 14:59:20,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:59:20,891 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2019-01-12 14:59:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:21,725 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 14:59:21,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:59:21,726 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-01-12 14:59:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:21,727 INFO L225 Difference]: With dead ends: 39 [2019-01-12 14:59:21,728 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:59:21,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1538, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:59:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:59:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 14:59:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 14:59:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 14:59:21,736 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 14:59:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:21,738 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 14:59:21,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 14:59:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 14:59:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:59:21,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:21,739 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:21,740 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:21,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:21,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 14:59:21,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:21,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:21,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:21,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:21,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 14:59:21,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:21,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:21,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:21,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:21,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:21,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 14:59:22,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:22,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 14:59:22,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 14:59:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 14:59:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:59:22,006 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 14:59:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:22,196 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 14:59:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:59:22,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 14:59:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:22,199 INFO L225 Difference]: With dead ends: 42 [2019-01-12 14:59:22,200 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 14:59:22,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:59:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 14:59:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 14:59:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 14:59:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 14:59:22,212 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 14:59:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:22,213 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 14:59:22,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 14:59:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 14:59:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 14:59:22,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:22,215 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:22,215 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 14:59:22,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:22,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:22,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:22,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:22,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 14:59:22,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:22,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:22,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:22,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 14:59:22,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:22,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 14:59:23,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:23,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2019-01-12 14:59:23,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 14:59:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 14:59:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 14:59:23,058 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2019-01-12 14:59:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:23,612 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 14:59:23,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 14:59:23,613 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2019-01-12 14:59:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:23,614 INFO L225 Difference]: With dead ends: 45 [2019-01-12 14:59:23,615 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:59:23,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=531, Invalid=2331, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 14:59:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:59:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:59:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:59:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 14:59:23,625 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 14:59:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:23,625 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 14:59:23,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 14:59:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 14:59:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:59:23,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:23,628 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:23,629 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:23,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 14:59:23,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:23,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:23,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:23,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 14:59:23,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:23,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:23,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:23,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:23,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:23,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 14:59:24,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:24,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 14:59:24,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 14:59:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 14:59:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:59:24,007 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 14:59:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:24,313 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 14:59:24,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:59:24,314 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 14:59:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:24,317 INFO L225 Difference]: With dead ends: 48 [2019-01-12 14:59:24,318 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 14:59:24,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 14:59:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 14:59:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 14:59:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 14:59:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 14:59:24,325 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 14:59:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:24,326 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 14:59:24,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 14:59:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 14:59:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 14:59:24,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:24,327 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:24,328 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 14:59:24,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:24,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:24,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 14:59:24,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:24,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:24,617 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:24,651 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 14:59:24,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:24,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 14:59:24,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:24,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 14:59:24,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 14:59:24,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 14:59:24,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:59:24,701 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 14:59:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:25,082 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 14:59:25,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 14:59:25,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 14:59:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:25,085 INFO L225 Difference]: With dead ends: 51 [2019-01-12 14:59:25,085 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:59:25,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 14:59:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:59:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:59:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:59:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 14:59:25,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 14:59:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:25,094 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 14:59:25,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 14:59:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 14:59:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 14:59:25,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:25,097 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:25,097 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:25,097 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 14:59:25,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:25,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:25,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 14:59:25,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:25,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:25,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:25,858 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 14:59:25,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:25,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 14:59:26,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:26,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 44 [2019-01-12 14:59:26,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-12 14:59:26,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-12 14:59:26,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:59:26,486 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 44 states. [2019-01-12 14:59:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:27,573 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 14:59:27,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 14:59:27,574 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 81 [2019-01-12 14:59:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:27,576 INFO L225 Difference]: With dead ends: 54 [2019-01-12 14:59:27,576 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 14:59:27,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=864, Invalid=3828, Unknown=0, NotChecked=0, Total=4692 [2019-01-12 14:59:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 14:59:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 14:59:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 14:59:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 14:59:27,587 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 14:59:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:27,587 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 14:59:27,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-12 14:59:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 14:59:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 14:59:27,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:27,591 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:27,591 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:27,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:27,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 14:59:27,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:27,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:27,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:27,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:27,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 14:59:28,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:28,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:28,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:28,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 14:59:28,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:28,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18] total 47 [2019-01-12 14:59:28,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-12 14:59:28,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-12 14:59:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 14:59:28,873 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 47 states. [2019-01-12 14:59:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:30,034 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 14:59:30,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 14:59:30,035 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 87 [2019-01-12 14:59:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:30,037 INFO L225 Difference]: With dead ends: 57 [2019-01-12 14:59:30,037 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:59:30,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=993, Invalid=4409, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 14:59:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:59:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 14:59:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 14:59:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 14:59:30,046 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 14:59:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:30,046 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 14:59:30,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-12 14:59:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 14:59:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 14:59:30,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:30,048 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:30,050 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 14:59:30,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:30,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:30,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:30,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:30,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 14:59:30,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:30,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:30,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:30,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:30,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 14:59:31,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:31,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2019-01-12 14:59:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-12 14:59:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-12 14:59:31,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 14:59:31,504 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 50 states. [2019-01-12 14:59:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:32,301 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 14:59:32,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 14:59:32,303 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 93 [2019-01-12 14:59:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:32,304 INFO L225 Difference]: With dead ends: 60 [2019-01-12 14:59:32,304 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 14:59:32,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1131, Invalid=5031, Unknown=0, NotChecked=0, Total=6162 [2019-01-12 14:59:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 14:59:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 14:59:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 14:59:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 14:59:32,314 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 14:59:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:32,314 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 14:59:32,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-12 14:59:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 14:59:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 14:59:32,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:32,318 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:32,318 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:32,319 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 14:59:32,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:32,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:32,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:32,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 14:59:32,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:32,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:32,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:32,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 14:59:32,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:32,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 14:59:33,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:33,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 20] total 53 [2019-01-12 14:59:33,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-12 14:59:33,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-12 14:59:33,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=2308, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 14:59:33,291 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 53 states. [2019-01-12 14:59:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:34,368 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 14:59:34,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 14:59:34,369 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 99 [2019-01-12 14:59:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:34,371 INFO L225 Difference]: With dead ends: 63 [2019-01-12 14:59:34,371 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 14:59:34,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1278, Invalid=5694, Unknown=0, NotChecked=0, Total=6972 [2019-01-12 14:59:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 14:59:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 14:59:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 14:59:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 14:59:34,383 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 14:59:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:34,383 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 14:59:34,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-12 14:59:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 14:59:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 14:59:34,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:34,385 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:34,385 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 14:59:34,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:34,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:34,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:34,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 14:59:34,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:34,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:34,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:34,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:34,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:34,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 14:59:35,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:35,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 21] total 56 [2019-01-12 14:59:35,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-12 14:59:35,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-12 14:59:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2579, Unknown=0, NotChecked=0, Total=3080 [2019-01-12 14:59:35,478 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 56 states. [2019-01-12 14:59:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:36,840 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-01-12 14:59:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 14:59:36,841 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 105 [2019-01-12 14:59:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:36,843 INFO L225 Difference]: With dead ends: 66 [2019-01-12 14:59:36,843 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 14:59:36,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1434, Invalid=6398, Unknown=0, NotChecked=0, Total=7832 [2019-01-12 14:59:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 14:59:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-12 14:59:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 14:59:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-01-12 14:59:36,852 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-01-12 14:59:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:36,853 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-01-12 14:59:36,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-12 14:59:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-01-12 14:59:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 14:59:36,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:36,856 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:36,856 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:36,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:36,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-01-12 14:59:36,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:36,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:36,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:36,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 14:59:37,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:37,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:37,150 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:37,194 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 14:59:37,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:37,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 14:59:37,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:37,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 14:59:37,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 14:59:37,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 14:59:37,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:59:37,268 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 22 states. [2019-01-12 14:59:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:37,573 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-01-12 14:59:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 14:59:37,574 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-01-12 14:59:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:37,576 INFO L225 Difference]: With dead ends: 69 [2019-01-12 14:59:37,576 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 14:59:37,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 14:59:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 14:59:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-12 14:59:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 14:59:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-12 14:59:37,583 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-01-12 14:59:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:37,583 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-12 14:59:37,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 14:59:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-12 14:59:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 14:59:37,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:37,586 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:37,587 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-01-12 14:59:37,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:37,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:37,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 14:59:37,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:37,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:37,880 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:37,920 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 14:59:37,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:37,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 14:59:37,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:37,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 14:59:37,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:59:37,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:59:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:59:37,986 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 23 states. [2019-01-12 14:59:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:38,356 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-12 14:59:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 14:59:38,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-01-12 14:59:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:38,359 INFO L225 Difference]: With dead ends: 72 [2019-01-12 14:59:38,360 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 14:59:38,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 14:59:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 14:59:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 14:59:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 14:59:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 14:59:38,367 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-01-12 14:59:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:38,367 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 14:59:38,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:59:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 14:59:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 14:59:38,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:38,370 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:38,371 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-01-12 14:59:38,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:38,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:38,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 14:59:38,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:38,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:38,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:38,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 14:59:38,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:38,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 14:59:38,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 14:59:38,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 14:59:38,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:59:38,953 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 24 states. [2019-01-12 14:59:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:39,330 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-12 14:59:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 14:59:39,336 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2019-01-12 14:59:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:39,337 INFO L225 Difference]: With dead ends: 75 [2019-01-12 14:59:39,337 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 14:59:39,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:59:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 14:59:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 14:59:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 14:59:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-12 14:59:39,345 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-01-12 14:59:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:39,347 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-12 14:59:39,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 14:59:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-12 14:59:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 14:59:39,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:39,350 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:39,350 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-01-12 14:59:39,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:39,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:39,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:39,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-01-12 14:59:39,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:39,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:39,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:39,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:39,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:39,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-01-12 14:59:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:39,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-12 14:59:39,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 14:59:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 14:59:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2019-01-12 14:59:39,794 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 25 states. [2019-01-12 14:59:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:40,378 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-01-12 14:59:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 14:59:40,379 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2019-01-12 14:59:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:40,381 INFO L225 Difference]: With dead ends: 78 [2019-01-12 14:59:40,381 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 14:59:40,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 14:59:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 14:59:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 14:59:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 14:59:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-01-12 14:59:40,389 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-01-12 14:59:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:40,390 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-01-12 14:59:40,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 14:59:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-01-12 14:59:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-12 14:59:40,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:40,391 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:40,391 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:40,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-01-12 14:59:40,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:40,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:40,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-01-12 14:59:41,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:41,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:41,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:41,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-12 14:59:41,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:41,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-01-12 14:59:41,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:41,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-12 14:59:41,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 14:59:41,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 14:59:41,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2019-01-12 14:59:41,302 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 26 states. [2019-01-12 14:59:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:41,745 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-01-12 14:59:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 14:59:41,749 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 135 [2019-01-12 14:59:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:41,750 INFO L225 Difference]: With dead ends: 81 [2019-01-12 14:59:41,751 INFO L226 Difference]: Without dead ends: 77 [2019-01-12 14:59:41,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 14:59:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-12 14:59:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-12 14:59:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 14:59:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-12 14:59:41,757 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-01-12 14:59:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:41,758 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-12 14:59:41,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 14:59:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-12 14:59:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 14:59:41,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:41,761 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:41,762 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-01-12 14:59:41,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:41,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:41,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-01-12 14:59:42,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:42,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:42,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:42,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:42,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:42,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-01-12 14:59:42,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:42,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-01-12 14:59:42,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-12 14:59:42,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-12 14:59:42,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-01-12 14:59:42,409 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 27 states. [2019-01-12 14:59:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:42,945 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-01-12 14:59:42,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 14:59:42,946 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 141 [2019-01-12 14:59:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:42,948 INFO L225 Difference]: With dead ends: 84 [2019-01-12 14:59:42,948 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 14:59:42,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 14:59:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 14:59:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-12 14:59:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 14:59:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-12 14:59:42,954 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-01-12 14:59:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:42,954 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-12 14:59:42,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-12 14:59:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-12 14:59:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 14:59:42,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:42,958 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:42,958 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-01-12 14:59:42,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:42,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:42,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:42,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:42,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-01-12 14:59:43,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:43,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:43,415 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:43,482 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-12 14:59:43,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:43,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-01-12 14:59:43,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:43,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-12 14:59:43,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 14:59:43,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 14:59:43,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2019-01-12 14:59:43,595 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 28 states. [2019-01-12 14:59:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:44,277 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-12 14:59:44,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 14:59:44,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 147 [2019-01-12 14:59:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:44,280 INFO L225 Difference]: With dead ends: 87 [2019-01-12 14:59:44,281 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 14:59:44,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 14:59:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 14:59:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-12 14:59:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 14:59:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-12 14:59:44,286 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-01-12 14:59:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:44,287 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-12 14:59:44,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 14:59:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-12 14:59:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-12 14:59:44,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:44,290 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:44,290 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:44,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-01-12 14:59:44,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:44,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:44,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:44,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:44,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-01-12 14:59:44,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:44,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:44,840 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:44,926 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-01-12 14:59:44,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:44,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-01-12 14:59:44,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:44,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-12 14:59:45,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 14:59:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 14:59:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:59:45,000 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 29 states. [2019-01-12 14:59:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:45,532 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-01-12 14:59:45,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 14:59:45,539 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 153 [2019-01-12 14:59:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:45,540 INFO L225 Difference]: With dead ends: 90 [2019-01-12 14:59:45,540 INFO L226 Difference]: Without dead ends: 86 [2019-01-12 14:59:45,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 14:59:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-12 14:59:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-12 14:59:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-12 14:59:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-01-12 14:59:45,552 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-01-12 14:59:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:45,552 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-01-12 14:59:45,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 14:59:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-01-12 14:59:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 14:59:45,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:45,556 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:45,556 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-01-12 14:59:45,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:45,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:45,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:45,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:45,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:59:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:59:45,654 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:59:45,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:59:45 BoogieIcfgContainer [2019-01-12 14:59:45,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:59:45,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:59:45,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:59:45,726 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:59:45,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:59:15" (3/4) ... [2019-01-12 14:59:45,729 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:59:45,831 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:59:45,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:59:45,835 INFO L168 Benchmark]: Toolchain (without parser) took 30802.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 452.5 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -82.5 MB). Peak memory consumption was 370.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:45,838 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:59:45,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.57 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:45,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.03 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:59:45,842 INFO L168 Benchmark]: Boogie Preprocessor took 15.11 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:59:45,843 INFO L168 Benchmark]: RCFGBuilder took 298.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:45,843 INFO L168 Benchmark]: TraceAbstraction took 30057.70 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.1 MB). Peak memory consumption was 379.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:45,843 INFO L168 Benchmark]: Witness Printer took 106.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:45,853 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.57 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 41.03 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.11 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 298.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30057.70 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.1 MB). Peak memory consumption was 379.3 MB. Max. memory is 11.5 GB. * Witness Printer took 106.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 25; [L11] CALL, EXPR id(input) VAL [\old(x)=25] [L5] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L6] CALL, EXPR id(x-1) VAL [\old(x)=24] [L5] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L6] CALL, EXPR id(x-1) VAL [\old(x)=23] [L5] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L6] CALL, EXPR id(x-1) VAL [\old(x)=22] [L5] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L6] CALL, EXPR id(x-1) VAL [\old(x)=21] [L5] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L6] CALL, EXPR id(x-1) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 25 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 29.9s OverallTime, 26 OverallIterations, 26 TraceHistogramMax, 13.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 221 SDtfs, 666 SDslu, 2844 SDs, 0 SdLazy, 2819 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3129 GetRequests, 2121 SyntacticMatches, 0 SemanticMatches, 1008 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8563 ImplicationChecksByTransitivity, 20.5s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 4200 NumberOfCodeBlocks, 4200 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 1048656 SizeOfPredicates, 331 NumberOfNonLiveVariables, 4776 ConjunctsInSsa, 696 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 15000/30000 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...