/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_10x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:19:46,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:19:46,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:19:46,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:19:46,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:19:46,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:19:46,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:19:46,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:19:46,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:19:46,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:19:46,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:19:46,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:19:46,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:19:46,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:19:46,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:19:46,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:19:46,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:19:46,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:19:46,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:19:46,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:19:46,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:19:46,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:19:46,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:19:46,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:19:46,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:19:46,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:19:46,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:19:46,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:19:46,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:19:46,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:19:46,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:19:46,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:19:46,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:19:46,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:19:46,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:19:46,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:19:46,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:19:46,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:19:46,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:19:46,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:19:46,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:19:46,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:19:46,465 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:19:46,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:19:46,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:19:46,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:19:46,468 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:19:46,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:19:46,469 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:19:46,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:19:46,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:19:46,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:19:46,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:19:46,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:19:46,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:19:46,471 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:19:46,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:19:46,472 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:19:46,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:19:46,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:19:46,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:19:46,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:19:46,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:19:46,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:46,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:19:46,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:19:46,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:19:46,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:19:46,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:19:46,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:19:46,474 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:19:46,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:19:46,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:19:46,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:19:46,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:19:46,961 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:19:46,962 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:19:46,963 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_10x0-2.c [2020-09-21 10:19:47,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5c3cf3021/3eabd412b6e54189808917f30c785c63/FLAGf19df51e3 [2020-09-21 10:19:47,616 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:19:47,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_10x0-2.c [2020-09-21 10:19:47,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5c3cf3021/3eabd412b6e54189808917f30c785c63/FLAGf19df51e3 [2020-09-21 10:19:47,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5c3cf3021/3eabd412b6e54189808917f30c785c63 [2020-09-21 10:19:47,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:19:48,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:19:48,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:48,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:19:48,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:19:48,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:47" (1/1) ... [2020-09-21 10:19:48,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ed318b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48, skipping insertion in model container [2020-09-21 10:19:48,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:47" (1/1) ... [2020-09-21 10:19:48,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:19:48,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:19:48,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:48,287 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:19:48,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:48,332 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:19:48,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48 WrapperNode [2020-09-21 10:19:48,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:48,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:19:48,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:19:48,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:19:48,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (1/1) ... [2020-09-21 10:19:48,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (1/1) ... [2020-09-21 10:19:48,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (1/1) ... [2020-09-21 10:19:48,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (1/1) ... [2020-09-21 10:19:48,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (1/1) ... [2020-09-21 10:19:48,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (1/1) ... [2020-09-21 10:19:48,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (1/1) ... [2020-09-21 10:19:48,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:19:48,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:19:48,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:19:48,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:19:48,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-21 10:19:48,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:19:48,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:19:48,529 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-21 10:19:48,529 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:19:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:19:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-21 10:19:48,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:19:48,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:19:48,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:19:48,730 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:19:48,731 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:19:48,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:48 BoogieIcfgContainer [2020-09-21 10:19:48,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:19:48,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:19:48,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:19:48,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:19:48,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:19:47" (1/3) ... [2020-09-21 10:19:48,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5779ec57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:48, skipping insertion in model container [2020-09-21 10:19:48,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:48" (2/3) ... [2020-09-21 10:19:48,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5779ec57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:48, skipping insertion in model container [2020-09-21 10:19:48,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:48" (3/3) ... [2020-09-21 10:19:48,748 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_10x0-2.c [2020-09-21 10:19:48,761 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:19:48,772 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:19:48,792 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:19:48,831 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:19:48,832 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:19:48,832 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:19:48,832 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:19:48,832 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:19:48,832 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:19:48,833 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:19:48,833 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:19:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-09-21 10:19:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:19:48,870 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:48,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:48,872 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:48,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2020-09-21 10:19:48,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:48,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2122532624] [2020-09-21 10:19:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:19:49,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2122532624] [2020-09-21 10:19:49,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:49,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:49,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026462616] [2020-09-21 10:19:49,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:49,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:49,227 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-09-21 10:19:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:49,350 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-09-21 10:19:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:49,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:19:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:49,368 INFO L225 Difference]: With dead ends: 30 [2020-09-21 10:19:49,368 INFO L226 Difference]: Without dead ends: 18 [2020-09-21 10:19:49,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-09-21 10:19:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-09-21 10:19:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-09-21 10:19:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-09-21 10:19:49,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-09-21 10:19:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:49,440 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-09-21 10:19:49,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-09-21 10:19:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-21 10:19:49,443 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:49,443 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:49,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:19:49,444 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2020-09-21 10:19:49,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:49,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [873183069] [2020-09-21 10:19:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-21 10:19:49,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [873183069] [2020-09-21 10:19:49,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:49,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:19:49,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518289757] [2020-09-21 10:19:49,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:19:49,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:19:49,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:49,619 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-09-21 10:19:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:49,690 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-09-21 10:19:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:19:49,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-09-21 10:19:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:49,692 INFO L225 Difference]: With dead ends: 25 [2020-09-21 10:19:49,692 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:19:49,694 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:49,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:19:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:19:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:19:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-09-21 10:19:49,701 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-09-21 10:19:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:49,702 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-09-21 10:19:49,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:19:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-09-21 10:19:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:19:49,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:49,704 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:49,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:19:49,705 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2020-09-21 10:19:49,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:49,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023170620] [2020-09-21 10:19:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-21 10:19:49,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023170620] [2020-09-21 10:19:49,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:49,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:49,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759962831] [2020-09-21 10:19:49,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:49,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:49,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:49,892 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-09-21 10:19:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:49,966 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-09-21 10:19:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:49,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-09-21 10:19:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:49,968 INFO L225 Difference]: With dead ends: 28 [2020-09-21 10:19:49,968 INFO L226 Difference]: Without dead ends: 24 [2020-09-21 10:19:49,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-09-21 10:19:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-09-21 10:19:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-09-21 10:19:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-09-21 10:19:49,977 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-09-21 10:19:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:49,978 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-09-21 10:19:49,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-09-21 10:19:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-21 10:19:49,980 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:49,980 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:49,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:19:49,981 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:49,981 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2020-09-21 10:19:49,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:49,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110168540] [2020-09-21 10:19:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-21 10:19:50,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110168540] [2020-09-21 10:19:50,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:50,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:50,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277440079] [2020-09-21 10:19:50,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:50,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:50,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:50,243 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-09-21 10:19:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:50,345 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-21 10:19:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:19:50,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-09-21 10:19:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:50,347 INFO L225 Difference]: With dead ends: 31 [2020-09-21 10:19:50,347 INFO L226 Difference]: Without dead ends: 27 [2020-09-21 10:19:50,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-09-21 10:19:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-09-21 10:19:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-09-21 10:19:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-09-21 10:19:50,355 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-09-21 10:19:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:50,356 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-09-21 10:19:50,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:19:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-09-21 10:19:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-21 10:19:50,358 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:50,358 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:50,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:19:50,358 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2020-09-21 10:19:50,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:50,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [674294889] [2020-09-21 10:19:50,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-21 10:19:50,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [674294889] [2020-09-21 10:19:50,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:50,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:19:50,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077433164] [2020-09-21 10:19:50,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:19:50,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:50,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:19:50,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:19:50,646 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-09-21 10:19:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:50,739 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-21 10:19:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:19:50,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-09-21 10:19:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:50,741 INFO L225 Difference]: With dead ends: 34 [2020-09-21 10:19:50,741 INFO L226 Difference]: Without dead ends: 30 [2020-09-21 10:19:50,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-21 10:19:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-21 10:19:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-21 10:19:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-21 10:19:50,749 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-09-21 10:19:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:50,749 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-21 10:19:50,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:19:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-21 10:19:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-21 10:19:50,751 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:50,751 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:50,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:19:50,752 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:50,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2020-09-21 10:19:50,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:50,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101500112] [2020-09-21 10:19:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-21 10:19:50,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101500112] [2020-09-21 10:19:50,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:50,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:19:50,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317019693] [2020-09-21 10:19:50,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:19:50,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:19:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:50,956 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-09-21 10:19:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:51,062 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-09-21 10:19:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:19:51,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-09-21 10:19:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:51,064 INFO L225 Difference]: With dead ends: 37 [2020-09-21 10:19:51,064 INFO L226 Difference]: Without dead ends: 33 [2020-09-21 10:19:51,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:19:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-21 10:19:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-21 10:19:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-21 10:19:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-21 10:19:51,073 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-09-21 10:19:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:51,073 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-21 10:19:51,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:19:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-21 10:19:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-21 10:19:51,075 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:51,076 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:51,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:19:51,076 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2020-09-21 10:19:51,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:51,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461347472] [2020-09-21 10:19:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-21 10:19:51,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461347472] [2020-09-21 10:19:51,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:51,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:51,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419393103] [2020-09-21 10:19:51,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:51,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:51,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:51,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:51,361 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-09-21 10:19:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:51,488 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-09-21 10:19:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:19:51,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-09-21 10:19:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:51,490 INFO L225 Difference]: With dead ends: 40 [2020-09-21 10:19:51,490 INFO L226 Difference]: Without dead ends: 36 [2020-09-21 10:19:51,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:19:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-21 10:19:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-21 10:19:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-21 10:19:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-09-21 10:19:51,498 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-09-21 10:19:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:51,499 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-09-21 10:19:51,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-09-21 10:19:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-21 10:19:51,500 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:51,500 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:51,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:19:51,501 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2020-09-21 10:19:51,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:51,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [693864342] [2020-09-21 10:19:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-21 10:19:51,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [693864342] [2020-09-21 10:19:51,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:51,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:19:51,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679562539] [2020-09-21 10:19:51,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:19:51,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:51,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:19:51,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:51,782 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-09-21 10:19:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:51,906 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-21 10:19:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:19:51,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-09-21 10:19:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:51,908 INFO L225 Difference]: With dead ends: 43 [2020-09-21 10:19:51,909 INFO L226 Difference]: Without dead ends: 39 [2020-09-21 10:19:51,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:19:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-21 10:19:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-09-21 10:19:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-21 10:19:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-09-21 10:19:51,916 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-09-21 10:19:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:51,917 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-09-21 10:19:51,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:19:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-09-21 10:19:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:19:51,918 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:51,919 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:51,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:19:51,919 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2020-09-21 10:19:51,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:51,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981105800] [2020-09-21 10:19:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-21 10:19:52,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981105800] [2020-09-21 10:19:52,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:52,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:19:52,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489506526] [2020-09-21 10:19:52,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:19:52,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:52,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:19:52,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:19:52,333 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-09-21 10:19:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:52,508 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-21 10:19:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:19:52,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-09-21 10:19:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:52,510 INFO L225 Difference]: With dead ends: 46 [2020-09-21 10:19:52,510 INFO L226 Difference]: Without dead ends: 42 [2020-09-21 10:19:52,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:19:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-21 10:19:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-21 10:19:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:19:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-21 10:19:52,529 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-09-21 10:19:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:52,529 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-21 10:19:52,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:19:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-21 10:19:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-21 10:19:52,531 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:52,531 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:52,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:19:52,532 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2020-09-21 10:19:52,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:52,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1733347055] [2020-09-21 10:19:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-21 10:19:52,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1733347055] [2020-09-21 10:19:52,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:52,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:19:52,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992485234] [2020-09-21 10:19:52,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:19:52,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:52,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:19:52,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:52,955 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-09-21 10:19:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:53,115 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-21 10:19:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:19:53,118 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-09-21 10:19:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:53,120 INFO L225 Difference]: With dead ends: 49 [2020-09-21 10:19:53,120 INFO L226 Difference]: Without dead ends: 45 [2020-09-21 10:19:53,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:19:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-21 10:19:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-21 10:19:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-21 10:19:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-21 10:19:53,134 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-09-21 10:19:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:53,134 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-21 10:19:53,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:19:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-21 10:19:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-21 10:19:53,139 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:53,139 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:53,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:19:53,143 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:53,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2020-09-21 10:19:53,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:53,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77172465] [2020-09-21 10:19:53,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:19:53,177 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:19:53,178 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:19:53,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:19:53,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:19:53 BoogieIcfgContainer [2020-09-21 10:19:53,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:19:53,237 INFO L168 Benchmark]: Toolchain (without parser) took 5236.26 ms. Allocated memory was 141.0 MB in the beginning and 281.0 MB in the end (delta: 140.0 MB). Free memory was 103.2 MB in the beginning and 191.7 MB in the end (delta: -88.5 MB). Peak memory consumption was 51.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:53,238 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-21 10:19:53,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.61 ms. Allocated memory is still 141.0 MB. Free memory was 102.6 MB in the beginning and 93.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:53,243 INFO L168 Benchmark]: Boogie Preprocessor took 29.26 ms. Allocated memory is still 141.0 MB. Free memory was 93.3 MB in the beginning and 91.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:53,247 INFO L168 Benchmark]: RCFGBuilder took 372.97 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 91.9 MB in the beginning and 172.9 MB in the end (delta: -81.0 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:53,248 INFO L168 Benchmark]: TraceAbstraction took 4495.06 ms. Allocated memory was 204.5 MB in the beginning and 281.0 MB in the end (delta: 76.5 MB). Free memory was 172.3 MB in the beginning and 191.7 MB in the end (delta: -19.4 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:53,259 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.20 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.61 ms. Allocated memory is still 141.0 MB. Free memory was 102.6 MB in the beginning and 93.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.26 ms. Allocated memory is still 141.0 MB. Free memory was 93.3 MB in the beginning and 91.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 372.97 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 91.9 MB in the beginning and 172.9 MB in the end (delta: -81.0 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4495.06 ms. Allocated memory was 204.5 MB in the beginning and 281.0 MB in the end (delta: 76.5 MB). Free memory was 172.3 MB in the beginning and 191.7 MB in the end (delta: -19.4 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 10; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND TRUE n <= 0 [L5] return m + n; [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.3s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 123 SDtfs, 163 SDslu, 394 SDs, 0 SdLazy, 296 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 43800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 450/900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...