/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 true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 05:57:55,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 05:57:55,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 05:57:55,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 05:57:55,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 05:57:55,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 05:57:55,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 05:57:55,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 05:57:55,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 05:57:55,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 05:57:55,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 05:57:55,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 05:57:55,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 05:57:55,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 05:57:55,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 05:57:55,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 05:57:55,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 05:57:55,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 05:57:55,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 05:57:55,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 05:57:55,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 05:57:55,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 05:57:55,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 05:57:55,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 05:57:55,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 05:57:55,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 05:57:55,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 05:57:55,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 05:57:55,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 05:57:55,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 05:57:55,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 05:57:55,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 05:57:55,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 05:57:55,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 05:57:55,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 05:57:55,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 05:57:55,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 05:57:55,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 05:57:55,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 05:57:55,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 05:57:55,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 05:57:55,543 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-08-19 05:57:55,594 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 05:57:55,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 05:57:55,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 05:57:55,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 05:57:55,599 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 05:57:55,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 05:57:55,600 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 05:57:55,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 05:57:55,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 05:57:55,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 05:57:55,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 05:57:55,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 05:57:55,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 05:57:55,601 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 05:57:55,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 05:57:55,601 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 05:57:55,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 05:57:55,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 05:57:55,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 05:57:55,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 05:57:55,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 05:57:55,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 05:57:55,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 05:57:55,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 05:57:55,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 05:57:55,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 05:57:55,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 05:57:55,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 05:57:55,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 05:57:55,606 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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4; [2020-08-19 05:57:55,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 05:57:55,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 05:57:55,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 05:57:55,935 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 05:57:55,935 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 05:57:55,936 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 05:57:56,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f20635d7/08adf6e8d510400799bcb97d3543080a/FLAG398cb3a49 [2020-08-19 05:57:56,454 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 05:57:56,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 05:57:56,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f20635d7/08adf6e8d510400799bcb97d3543080a/FLAG398cb3a49 [2020-08-19 05:57:56,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f20635d7/08adf6e8d510400799bcb97d3543080a [2020-08-19 05:57:56,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 05:57:56,901 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 05:57:56,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 05:57:56,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 05:57:56,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 05:57:56,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 05:57:56" (1/1) ... [2020-08-19 05:57:56,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39bc374b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:56, skipping insertion in model container [2020-08-19 05:57:56,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 05:57:56" (1/1) ... [2020-08-19 05:57:56,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 05:57:56,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 05:57:57,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 05:57:57,182 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 05:57:57,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 05:57:57,226 INFO L208 MainTranslator]: Completed translation [2020-08-19 05:57:57,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57 WrapperNode [2020-08-19 05:57:57,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 05:57:57,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 05:57:57,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 05:57:57,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 05:57:57,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (1/1) ... [2020-08-19 05:57:57,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (1/1) ... [2020-08-19 05:57:57,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (1/1) ... [2020-08-19 05:57:57,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (1/1) ... [2020-08-19 05:57:57,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (1/1) ... [2020-08-19 05:57:57,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (1/1) ... [2020-08-19 05:57:57,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (1/1) ... [2020-08-19 05:57:57,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 05:57:57,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 05:57:57,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 05:57:57,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 05:57:57,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (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-08-19 05:57:57,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 05:57:57,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 05:57:57,423 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-19 05:57:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 05:57:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 05:57:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 05:57:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-19 05:57:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 05:57:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 05:57:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 05:57:57,702 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 05:57:57,703 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 05:57:57,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 05:57:57 BoogieIcfgContainer [2020-08-19 05:57:57,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 05:57:57,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 05:57:57,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 05:57:57,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 05:57:57,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 05:57:56" (1/3) ... [2020-08-19 05:57:57,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf97a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 05:57:57, skipping insertion in model container [2020-08-19 05:57:57,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:57:57" (2/3) ... [2020-08-19 05:57:57,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf97a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 05:57:57, skipping insertion in model container [2020-08-19 05:57:57,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 05:57:57" (3/3) ... [2020-08-19 05:57:57,730 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-19 05:57:57,743 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 05:57:57,752 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 05:57:57,767 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 05:57:57,795 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 05:57:57,796 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 05:57:57,796 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 05:57:57,796 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 05:57:57,796 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 05:57:57,796 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 05:57:57,797 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 05:57:57,797 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 05:57:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-19 05:57:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 05:57:57,823 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:57:57,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:57:57,825 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:57:57,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:57:57,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-19 05:57:57,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:57:57,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [598422346] [2020-08-19 05:57:57,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:57:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:57:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:57:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 05:57:58,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [598422346] [2020-08-19 05:57:58,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 05:57:58,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 05:57:58,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889261261] [2020-08-19 05:57:58,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 05:57:58,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:57:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 05:57:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 05:57:58,084 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-19 05:57:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:57:58,216 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 05:57:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 05:57:58,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 05:57:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:57:58,230 INFO L225 Difference]: With dead ends: 35 [2020-08-19 05:57:58,230 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 05:57:58,234 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-08-19 05:57:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 05:57:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 05:57:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 05:57:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 05:57:58,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 05:57:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:57:58,279 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 05:57:58,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 05:57:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 05:57:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 05:57:58,282 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:57:58,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:57:58,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 05:57:58,284 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:57:58,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:57:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-19 05:57:58,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:57:58,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1593591588] [2020-08-19 05:57:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:57:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:57:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:57:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 05:57:58,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1593591588] [2020-08-19 05:57:58,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 05:57:58,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 05:57:58,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901023] [2020-08-19 05:57:58,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 05:57:58,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:57:58,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 05:57:58,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 05:57:58,362 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 05:57:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:57:58,434 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 05:57:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 05:57:58,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 05:57:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:57:58,437 INFO L225 Difference]: With dead ends: 27 [2020-08-19 05:57:58,437 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 05:57:58,438 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-08-19 05:57:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 05:57:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 05:57:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 05:57:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 05:57:58,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 05:57:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:57:58,447 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 05:57:58,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 05:57:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 05:57:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 05:57:58,449 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:57:58,449 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:57:58,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 05:57:58,450 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:57:58,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:57:58,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-19 05:57:58,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:57:58,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1014935917] [2020-08-19 05:57:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:57:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:57:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:57:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:57:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 05:57:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-19 05:57:58,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1014935917] [2020-08-19 05:57:58,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:57:58,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 05:57:58,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167952708] [2020-08-19 05:57:58,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 05:57:58,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:57:58,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 05:57:58,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 05:57:58,587 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-19 05:57:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:57:58,814 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 05:57:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 05:57:58,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-19 05:57:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:57:58,819 INFO L225 Difference]: With dead ends: 38 [2020-08-19 05:57:58,819 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 05:57:58,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-19 05:57:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 05:57:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 05:57:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 05:57:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 05:57:58,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 05:57:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:57:58,837 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 05:57:58,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 05:57:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 05:57:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 05:57:58,843 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:57:58,843 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:57:58,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 05:57:58,844 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:57:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:57:58,845 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-19 05:57:58,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:57:58,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [674765957] [2020-08-19 05:57:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:57:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:57:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:57:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:58,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:57:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:57:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-19 05:57:59,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [674765957] [2020-08-19 05:57:59,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:57:59,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 05:57:59,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58560325] [2020-08-19 05:57:59,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 05:57:59,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:57:59,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 05:57:59,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 05:57:59,019 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 05:57:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:57:59,160 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 05:57:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 05:57:59,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 05:57:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:57:59,163 INFO L225 Difference]: With dead ends: 41 [2020-08-19 05:57:59,163 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 05:57:59,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-08-19 05:57:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 05:57:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 05:57:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 05:57:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 05:57:59,177 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 05:57:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:57:59,177 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 05:57:59,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 05:57:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 05:57:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 05:57:59,179 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:57:59,180 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:57:59,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 05:57:59,180 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:57:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:57:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-19 05:57:59,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:57:59,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172537291] [2020-08-19 05:57:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:57:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:57:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:57:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:57:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:57:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:57:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:57:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-19 05:57:59,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172537291] [2020-08-19 05:57:59,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:57:59,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 05:57:59,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293264981] [2020-08-19 05:57:59,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 05:57:59,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:57:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 05:57:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 05:57:59,401 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-19 05:57:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:57:59,525 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-19 05:57:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 05:57:59,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-19 05:57:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:57:59,528 INFO L225 Difference]: With dead ends: 76 [2020-08-19 05:57:59,528 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 05:57:59,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-19 05:57:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 05:57:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-19 05:57:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 05:57:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-19 05:57:59,541 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-19 05:57:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:57:59,542 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-19 05:57:59,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 05:57:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-19 05:57:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 05:57:59,544 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:57:59,545 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:57:59,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 05:57:59,545 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:57:59,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:57:59,546 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-19 05:57:59,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:57:59,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [466000727] [2020-08-19 05:57:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:57:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:57:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:57:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:57:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:57:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:57:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:57:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-19 05:57:59,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [466000727] [2020-08-19 05:57:59,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:57:59,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 05:57:59,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602508663] [2020-08-19 05:57:59,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 05:57:59,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:57:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 05:57:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 05:57:59,690 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-19 05:57:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:57:59,802 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-19 05:57:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 05:57:59,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 05:57:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:57:59,805 INFO L225 Difference]: With dead ends: 62 [2020-08-19 05:57:59,805 INFO L226 Difference]: Without dead ends: 58 [2020-08-19 05:57:59,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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-08-19 05:57:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-19 05:57:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-19 05:57:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-19 05:57:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-19 05:57:59,820 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-19 05:57:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:57:59,820 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-19 05:57:59,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 05:57:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-19 05:57:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-19 05:57:59,825 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:57:59,825 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:57:59,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 05:57:59,826 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:57:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:57:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-19 05:57:59,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:57:59,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104022865] [2020-08-19 05:57:59,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:57:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:57:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:57:59,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:57:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-19 05:58:00,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104022865] [2020-08-19 05:58:00,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:58:00,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 05:58:00,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594633328] [2020-08-19 05:58:00,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 05:58:00,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:58:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 05:58:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 05:58:00,199 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-19 05:58:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:58:00,374 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-19 05:58:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 05:58:00,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-19 05:58:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:58:00,379 INFO L225 Difference]: With dead ends: 97 [2020-08-19 05:58:00,379 INFO L226 Difference]: Without dead ends: 93 [2020-08-19 05:58:00,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 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-08-19 05:58:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-19 05:58:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-19 05:58:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-19 05:58:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-19 05:58:00,400 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-19 05:58:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:58:00,401 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-19 05:58:00,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 05:58:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-19 05:58:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-19 05:58:00,406 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:58:00,406 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:58:00,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 05:58:00,407 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:58:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:58:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-19 05:58:00,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:58:00,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [616519395] [2020-08-19 05:58:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:58:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:58:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:58:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:58:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:58:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-19 05:58:00,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [616519395] [2020-08-19 05:58:00,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:58:00,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 05:58:00,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436104595] [2020-08-19 05:58:00,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 05:58:00,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:58:00,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 05:58:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-19 05:58:00,836 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-19 05:58:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:58:01,227 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-19 05:58:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 05:58:01,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-19 05:58:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:58:01,230 INFO L225 Difference]: With dead ends: 153 [2020-08-19 05:58:01,231 INFO L226 Difference]: Without dead ends: 71 [2020-08-19 05:58:01,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-19 05:58:01,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-19 05:58:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-19 05:58:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-19 05:58:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-19 05:58:01,244 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-19 05:58:01,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:58:01,245 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-19 05:58:01,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 05:58:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-19 05:58:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 05:58:01,247 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:58:01,247 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:58:01,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 05:58:01,247 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:58:01,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:58:01,248 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-19 05:58:01,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:58:01,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [951114415] [2020-08-19 05:58:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:58:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:58:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:58:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:58:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-19 05:58:01,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [951114415] [2020-08-19 05:58:01,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:58:01,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 05:58:01,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379316592] [2020-08-19 05:58:01,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 05:58:01,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:58:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 05:58:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 05:58:01,562 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-19 05:58:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:58:01,724 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-19 05:58:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 05:58:01,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-19 05:58:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:58:01,726 INFO L225 Difference]: With dead ends: 68 [2020-08-19 05:58:01,726 INFO L226 Difference]: Without dead ends: 64 [2020-08-19 05:58:01,727 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 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-08-19 05:58:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-19 05:58:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-19 05:58:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-19 05:58:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-19 05:58:01,736 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-19 05:58:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:58:01,737 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-19 05:58:01,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 05:58:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-19 05:58:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 05:58:01,740 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:58:01,740 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:58:01,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 05:58:01,741 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:58:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:58:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-19 05:58:01,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:58:01,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1806098625] [2020-08-19 05:58:01,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:58:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:58:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:58:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:01,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:58:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 05:58:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-19 05:58:02,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1806098625] [2020-08-19 05:58:02,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:58:02,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 05:58:02,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619044375] [2020-08-19 05:58:02,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 05:58:02,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:58:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 05:58:02,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 05:58:02,140 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-19 05:58:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:58:02,410 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-19 05:58:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 05:58:02,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 05:58:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:58:02,416 INFO L225 Difference]: With dead ends: 180 [2020-08-19 05:58:02,416 INFO L226 Difference]: Without dead ends: 176 [2020-08-19 05:58:02,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 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-08-19 05:58:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-19 05:58:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-19 05:58:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-19 05:58:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-19 05:58:02,464 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-19 05:58:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:58:02,467 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-19 05:58:02,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 05:58:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-19 05:58:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-19 05:58:02,474 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:58:02,475 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:58:02,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 05:58:02,475 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:58:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:58:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-19 05:58:02,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:58:02,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [216891384] [2020-08-19 05:58:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:58:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:58:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:58:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:58:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:02,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 05:58:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 05:58:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:58:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:58:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:58:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:58:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:58:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:58:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-19 05:58:03,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [216891384] [2020-08-19 05:58:03,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:58:03,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 05:58:03,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066364339] [2020-08-19 05:58:03,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 05:58:03,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:58:03,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 05:58:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 05:58:03,278 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-19 05:58:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:58:03,619 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-19 05:58:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 05:58:03,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-19 05:58:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:58:03,626 INFO L225 Difference]: With dead ends: 410 [2020-08-19 05:58:03,626 INFO L226 Difference]: Without dead ends: 406 [2020-08-19 05:58:03,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 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-08-19 05:58:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-19 05:58:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-19 05:58:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-19 05:58:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-19 05:58:03,679 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-19 05:58:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:58:03,680 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-19 05:58:03,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 05:58:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-19 05:58:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-19 05:58:03,692 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:58:03,693 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:58:03,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 05:58:03,693 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:58:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:58:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-19 05:58:03,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:58:03,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1216697284] [2020-08-19 05:58:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:58:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 05:58:03,835 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 05:58:03,836 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 05:58:03,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 05:58:03,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 05:58:03 BoogieIcfgContainer [2020-08-19 05:58:03,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 05:58:03,928 INFO L168 Benchmark]: Toolchain (without parser) took 7026.57 ms. Allocated memory was 139.5 MB in the beginning and 371.7 MB in the end (delta: 232.3 MB). Free memory was 102.5 MB in the beginning and 182.7 MB in the end (delta: -80.2 MB). Peak memory consumption was 152.1 MB. Max. memory is 7.1 GB. [2020-08-19 05:58:03,929 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-19 05:58:03,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.21 ms. Allocated memory is still 139.5 MB. Free memory was 102.3 MB in the beginning and 93.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-19 05:58:03,935 INFO L168 Benchmark]: Boogie Preprocessor took 114.91 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 93.0 MB in the beginning and 180.9 MB in the end (delta: -88.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-19 05:58:03,936 INFO L168 Benchmark]: RCFGBuilder took 368.72 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 168.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-08-19 05:58:03,937 INFO L168 Benchmark]: TraceAbstraction took 6211.56 ms. Allocated memory was 201.9 MB in the beginning and 371.7 MB in the end (delta: 169.9 MB). Free memory was 168.4 MB in the beginning and 182.7 MB in the end (delta: -14.3 MB). Peak memory consumption was 155.6 MB. Max. memory is 7.1 GB. [2020-08-19 05:58:03,947 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.21 ms. Allocated memory is still 139.5 MB. Free memory was 102.3 MB in the beginning and 93.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.91 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 93.0 MB in the beginning and 180.9 MB in the end (delta: -88.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.72 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 168.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6211.56 ms. Allocated memory was 201.9 MB in the beginning and 371.7 MB in the end (delta: 169.9 MB). Free memory was 168.4 MB in the beginning and 182.7 MB in the end (delta: -14.3 MB). Peak memory consumption was 155.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.0s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 310 SDslu, 530 SDs, 0 SdLazy, 895 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 243366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 6018/8497 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...