/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:17:30,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:17:30,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:17:30,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:17:30,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:17:30,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:17:30,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:17:30,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:17:30,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:17:30,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:17:30,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:17:30,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:17:30,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:17:30,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:17:30,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:17:30,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:17:30,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:17:30,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:17:30,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:17:30,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:17:30,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:17:30,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:17:30,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:17:30,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:17:30,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:17:30,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:17:30,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:17:30,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:17:30,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:17:30,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:17:30,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:17:30,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:17:30,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:17:30,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:17:30,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:17:30,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:17:30,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:17:30,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:17:30,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:17:30,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:17:30,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:17:30,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:17:30,941 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:17:30,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:17:30,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:17:30,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:17:30,943 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:17:30,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:17:30,943 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:17:30,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:17:30,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:17:30,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:17:30,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:17:30,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:17:30,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:17:30,945 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:17:30,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:17:30,945 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:17:30,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:17:30,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:17:30,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:17:30,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:17:30,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:17:30,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:17:30,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:17:30,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:17:30,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:17:30,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:17:30,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:17:30,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:17:30,948 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:17:30,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:17:31,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:17:31,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:17:31,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:17:31,463 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:17:31,463 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:17:31,464 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-09-21 10:17:31,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80568a6d5/6d5cf7f99aef403cb66f095c9af0e1cb/FLAG90a30fdc4 [2020-09-21 10:17:32,110 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:17:32,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-09-21 10:17:32,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80568a6d5/6d5cf7f99aef403cb66f095c9af0e1cb/FLAG90a30fdc4 [2020-09-21 10:17:32,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80568a6d5/6d5cf7f99aef403cb66f095c9af0e1cb [2020-09-21 10:17:32,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:17:32,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:17:32,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:17:32,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:17:32,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:17:32,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70996f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32, skipping insertion in model container [2020-09-21 10:17:32,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:17:32,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:17:32,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:17:32,730 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:17:32,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:17:32,762 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:17:32,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32 WrapperNode [2020-09-21 10:17:32,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:17:32,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:17:32,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:17:32,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:17:32,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (1/1) ... [2020-09-21 10:17:32,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:17:32,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:17:32,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:17:32,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:17:32,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-09-21 10:17:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:17:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:17:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:17:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-09-21 10:17:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:17:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:17:32,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:17:33,168 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:17:33,168 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:17:33,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:17:33 BoogieIcfgContainer [2020-09-21 10:17:33,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:17:33,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:17:33,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:17:33,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:17:33,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:17:32" (1/3) ... [2020-09-21 10:17:33,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1afc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:17:33, skipping insertion in model container [2020-09-21 10:17:33,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:32" (2/3) ... [2020-09-21 10:17:33,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1afc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:17:33, skipping insertion in model container [2020-09-21 10:17:33,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:17:33" (3/3) ... [2020-09-21 10:17:33,184 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-09-21 10:17:33,198 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:17:33,208 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:17:33,246 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:17:33,288 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:17:33,289 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:17:33,289 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:17:33,289 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:17:33,290 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:17:33,290 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:17:33,290 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:17:33,290 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:17:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-09-21 10:17:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:17:33,330 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:33,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:33,333 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-09-21 10:17:33,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:33,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542207423] [2020-09-21 10:17:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:17:33,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542207423] [2020-09-21 10:17:33,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:17:33,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:17:33,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454049482] [2020-09-21 10:17:33,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:17:33,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:17:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:33,683 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-09-21 10:17:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:33,813 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-09-21 10:17:33,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:17:33,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:17:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:33,829 INFO L225 Difference]: With dead ends: 35 [2020-09-21 10:17:33,830 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:17:33,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:17:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:17:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:17:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-21 10:17:33,888 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-09-21 10:17:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:33,889 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-21 10:17:33,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:17:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-21 10:17:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-21 10:17:33,892 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:33,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:33,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:17:33,893 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-09-21 10:17:33,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:33,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [88129600] [2020-09-21 10:17:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:17:33,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [88129600] [2020-09-21 10:17:33,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:17:33,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:17:33,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336076466] [2020-09-21 10:17:33,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:17:33,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:17:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:33,984 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-09-21 10:17:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:34,060 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-09-21 10:17:34,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:17:34,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-21 10:17:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:34,062 INFO L225 Difference]: With dead ends: 27 [2020-09-21 10:17:34,063 INFO L226 Difference]: Without dead ends: 23 [2020-09-21 10:17:34,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-21 10:17:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-09-21 10:17:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:17:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-21 10:17:34,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-09-21 10:17:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:34,073 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-21 10:17:34,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:17:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-21 10:17:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:17:34,075 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:34,075 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-09-21 10:17:34,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:17:34,076 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-09-21 10:17:34,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:34,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1799844993] [2020-09-21 10:17:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-21 10:17:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-21 10:17:34,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1799844993] [2020-09-21 10:17:34,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:34,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:17:34,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585978360] [2020-09-21 10:17:34,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:17:34,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:34,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:17:34,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:34,230 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-09-21 10:17:34,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:34,324 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-09-21 10:17:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:17:34,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-09-21 10:17:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:34,326 INFO L225 Difference]: With dead ends: 38 [2020-09-21 10:17:34,327 INFO L226 Difference]: Without dead ends: 23 [2020-09-21 10:17:34,328 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-09-21 10:17:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-21 10:17:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-21 10:17:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-21 10:17:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-09-21 10:17:34,336 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-09-21 10:17:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:34,337 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-09-21 10:17:34,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:17:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-09-21 10:17:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-21 10:17:34,339 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:34,339 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-09-21 10:17:34,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:17:34,340 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-09-21 10:17:34,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:34,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440066072] [2020-09-21 10:17:34,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-21 10:17:34,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [440066072] [2020-09-21 10:17:34,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:34,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:17:34,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802635113] [2020-09-21 10:17:34,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:17:34,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:17:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:34,472 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-09-21 10:17:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:34,596 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-09-21 10:17:34,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:17:34,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-21 10:17:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:34,600 INFO L225 Difference]: With dead ends: 41 [2020-09-21 10:17:34,600 INFO L226 Difference]: Without dead ends: 37 [2020-09-21 10:17:34,601 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-09-21 10:17:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-09-21 10:17:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-09-21 10:17:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-21 10:17:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-09-21 10:17:34,613 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-09-21 10:17:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:34,614 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-09-21 10:17:34,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:17:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-09-21 10:17:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-21 10:17:34,616 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:34,616 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-09-21 10:17:34,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:17:34,617 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-09-21 10:17:34,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:34,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641970628] [2020-09-21 10:17:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-21 10:17:34,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641970628] [2020-09-21 10:17:34,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:34,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:17:34,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653170976] [2020-09-21 10:17:34,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:17:34,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:17:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:17:34,800 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-09-21 10:17:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:34,910 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-09-21 10:17:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:17:34,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-09-21 10:17:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:34,913 INFO L225 Difference]: With dead ends: 76 [2020-09-21 10:17:34,913 INFO L226 Difference]: Without dead ends: 45 [2020-09-21 10:17:34,915 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-09-21 10:17:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-21 10:17:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-09-21 10:17:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-21 10:17:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-09-21 10:17:34,927 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-09-21 10:17:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:34,928 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-09-21 10:17:34,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:17:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-09-21 10:17:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-21 10:17:34,930 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:34,930 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-09-21 10:17:34,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:17:34,931 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-09-21 10:17:34,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:34,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [803774743] [2020-09-21 10:17:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-21 10:17:35,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [803774743] [2020-09-21 10:17:35,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:35,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:17:35,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655293554] [2020-09-21 10:17:35,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:17:35,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:35,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:17:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:17:35,100 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-09-21 10:17:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:35,212 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-09-21 10:17:35,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:17:35,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-09-21 10:17:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:35,215 INFO L225 Difference]: With dead ends: 62 [2020-09-21 10:17:35,215 INFO L226 Difference]: Without dead ends: 58 [2020-09-21 10:17:35,216 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-09-21 10:17:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-21 10:17:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-09-21 10:17:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-21 10:17:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-09-21 10:17:35,230 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-09-21 10:17:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:35,231 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-09-21 10:17:35,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:17:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-09-21 10:17:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-21 10:17:35,235 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:35,236 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-09-21 10:17:35,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:17:35,236 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:35,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:35,237 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-09-21 10:17:35,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:35,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [185470884] [2020-09-21 10:17:35,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-09-21 10:17:35,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [185470884] [2020-09-21 10:17:35,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:35,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:17:35,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744222145] [2020-09-21 10:17:35,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:17:35,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:35,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:17:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:17:35,528 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-09-21 10:17:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:35,735 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-09-21 10:17:35,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:17:35,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-09-21 10:17:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:35,741 INFO L225 Difference]: With dead ends: 97 [2020-09-21 10:17:35,741 INFO L226 Difference]: Without dead ends: 93 [2020-09-21 10:17:35,742 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-09-21 10:17:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-21 10:17:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-09-21 10:17:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-09-21 10:17:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-09-21 10:17:35,763 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-09-21 10:17:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:35,764 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-09-21 10:17:35,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:17:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-09-21 10:17:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-09-21 10:17:35,770 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:35,770 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-09-21 10:17:35,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:17:35,770 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:35,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-09-21 10:17:35,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:35,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491692068] [2020-09-21 10:17:35,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-09-21 10:17:36,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491692068] [2020-09-21 10:17:36,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:36,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:17:36,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896374189] [2020-09-21 10:17:36,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:17:36,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:17:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:17:36,280 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-09-21 10:17:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:36,731 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-09-21 10:17:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-21 10:17:36,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-09-21 10:17:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:36,735 INFO L225 Difference]: With dead ends: 153 [2020-09-21 10:17:36,735 INFO L226 Difference]: Without dead ends: 71 [2020-09-21 10:17:36,741 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-09-21 10:17:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-09-21 10:17:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-09-21 10:17:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-21 10:17:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-09-21 10:17:36,762 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-09-21 10:17:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:36,763 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-09-21 10:17:36,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:17:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-09-21 10:17:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-21 10:17:36,765 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:36,766 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-09-21 10:17:36,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:17:36,770 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-09-21 10:17:36,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:36,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [832455499] [2020-09-21 10:17:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-09-21 10:17:37,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [832455499] [2020-09-21 10:17:37,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:37,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:17:37,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726847134] [2020-09-21 10:17:37,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:17:37,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:17:37,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:17:37,171 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-09-21 10:17:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:37,336 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-09-21 10:17:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:17:37,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-09-21 10:17:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:37,338 INFO L225 Difference]: With dead ends: 68 [2020-09-21 10:17:37,338 INFO L226 Difference]: Without dead ends: 64 [2020-09-21 10:17:37,339 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-09-21 10:17:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-09-21 10:17:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-09-21 10:17:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-09-21 10:17:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-09-21 10:17:37,348 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-09-21 10:17:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:37,348 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-09-21 10:17:37,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:17:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-09-21 10:17:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-09-21 10:17:37,350 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:37,351 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-09-21 10:17:37,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:17:37,351 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-09-21 10:17:37,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:37,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399259491] [2020-09-21 10:17:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:17:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-09-21 10:17:37,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399259491] [2020-09-21 10:17:37,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:37,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:17:37,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090130290] [2020-09-21 10:17:37,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:17:37,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:37,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:17:37,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:37,827 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-09-21 10:17:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:38,048 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-09-21 10:17:38,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:17:38,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-09-21 10:17:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:38,051 INFO L225 Difference]: With dead ends: 180 [2020-09-21 10:17:38,051 INFO L226 Difference]: Without dead ends: 176 [2020-09-21 10:17:38,052 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-09-21 10:17:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-09-21 10:17:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-09-21 10:17:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-09-21 10:17:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-09-21 10:17:38,073 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-09-21 10:17:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:38,074 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-09-21 10:17:38,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:17:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-09-21 10:17:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-09-21 10:17:38,078 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:38,079 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-09-21 10:17:38,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:17:38,079 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:38,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:38,080 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-09-21 10:17:38,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:38,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340689531] [2020-09-21 10:17:38,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:17:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-21 10:17:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-09-21 10:17:38,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340689531] [2020-09-21 10:17:38,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:38,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:17:38,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029198396] [2020-09-21 10:17:38,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:17:38,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:38,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:17:38,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:17:38,960 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-09-21 10:17:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:39,272 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-09-21 10:17:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:17:39,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-09-21 10:17:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:39,279 INFO L225 Difference]: With dead ends: 410 [2020-09-21 10:17:39,279 INFO L226 Difference]: Without dead ends: 406 [2020-09-21 10:17:39,281 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-09-21 10:17:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-09-21 10:17:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-09-21 10:17:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-09-21 10:17:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-09-21 10:17:39,343 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-09-21 10:17:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:39,345 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-09-21 10:17:39,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:17:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-09-21 10:17:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-09-21 10:17:39,356 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:39,357 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-09-21 10:17:39,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:17:39,357 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:39,358 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-09-21 10:17:39,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:39,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745281498] [2020-09-21 10:17:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:17:39,540 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:17:39,540 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:17:39,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:17:39,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:17:39 BoogieIcfgContainer [2020-09-21 10:17:39,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:17:39,655 INFO L168 Benchmark]: Toolchain (without parser) took 7200.85 ms. Allocated memory was 137.9 MB in the beginning and 380.6 MB in the end (delta: 242.7 MB). Free memory was 101.8 MB in the beginning and 250.6 MB in the end (delta: -148.8 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:17:39,656 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:17:39,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.40 ms. Allocated memory is still 137.9 MB. Free memory was 101.1 MB in the beginning and 91.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-09-21 10:17:39,662 INFO L168 Benchmark]: Boogie Preprocessor took 114.83 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 91.9 MB in the beginning and 179.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-09-21 10:17:39,663 INFO L168 Benchmark]: RCFGBuilder took 295.21 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 166.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:17:39,665 INFO L168 Benchmark]: TraceAbstraction took 6476.16 ms. Allocated memory was 200.3 MB in the beginning and 380.6 MB in the end (delta: 180.4 MB). Free memory was 165.8 MB in the beginning and 250.6 MB in the end (delta: -84.8 MB). Peak memory consumption was 95.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:17:39,674 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.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.40 ms. Allocated memory is still 137.9 MB. Free memory was 101.1 MB in the beginning and 91.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.83 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 91.9 MB in the beginning and 179.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 295.21 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 166.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6476.16 ms. Allocated memory was 200.3 MB in the beginning and 380.6 MB in the end (delta: 180.4 MB). Free memory was 165.8 MB in the beginning and 250.6 MB in the end (delta: -84.8 MB). Peak memory consumption was 95.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.2s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 310 SDslu, 530 SDs, 0 SdLazy, 891 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s 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, 3.0s 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...