/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=DEEPEST --traceabstraction.additional.smt.options log-additional-information=true -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-177f698 [2020-08-21 20:31:34,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 20:31:34,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 20:31:34,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 20:31:34,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 20:31:34,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 20:31:34,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 20:31:34,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 20:31:34,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 20:31:34,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 20:31:34,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 20:31:34,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 20:31:34,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 20:31:34,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 20:31:34,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 20:31:34,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 20:31:34,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 20:31:34,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 20:31:34,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 20:31:34,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 20:31:34,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 20:31:34,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 20:31:34,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 20:31:34,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 20:31:34,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 20:31:34,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 20:31:34,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 20:31:34,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 20:31:34,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 20:31:34,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 20:31:34,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 20:31:34,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 20:31:34,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 20:31:34,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 20:31:34,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 20:31:34,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 20:31:34,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 20:31:34,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 20:31:34,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 20:31:34,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 20:31:34,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 20:31:34,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 20:31:35,025 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 20:31:35,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 20:31:35,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 20:31:35,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 20:31:35,028 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 20:31:35,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 20:31:35,028 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 20:31:35,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 20:31:35,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 20:31:35,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 20:31:35,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 20:31:35,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 20:31:35,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 20:31:35,031 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 20:31:35,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 20:31:35,031 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 20:31:35,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 20:31:35,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 20:31:35,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 20:31:35,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 20:31:35,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 20:31:35,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 20:31:35,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 20:31:35,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 20:31:35,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 20:31:35,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 20:31:35,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 20:31:35,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 20:31:35,034 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 20:31:35,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=DEEPEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=DEEPEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=DEEPEST;log-additional-information=true; [2020-08-21 20:31:35,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 20:31:35,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 20:31:35,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 20:31:35,355 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 20:31:35,356 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 20:31:35,356 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 20:31:35,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6b9da23f3/5e10b50180324e3393da96f84b6b8af1/FLAG7dba6f13d [2020-08-21 20:31:35,872 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 20:31:35,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 20:31:35,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6b9da23f3/5e10b50180324e3393da96f84b6b8af1/FLAG7dba6f13d [2020-08-21 20:31:36,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6b9da23f3/5e10b50180324e3393da96f84b6b8af1 [2020-08-21 20:31:36,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 20:31:36,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 20:31:36,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 20:31:36,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 20:31:36,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 20:31:36,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347c51ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36, skipping insertion in model container [2020-08-21 20:31:36,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 20:31:36,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 20:31:36,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 20:31:36,514 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 20:31:36,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 20:31:36,539 INFO L208 MainTranslator]: Completed translation [2020-08-21 20:31:36,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36 WrapperNode [2020-08-21 20:31:36,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 20:31:36,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 20:31:36,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 20:31:36,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 20:31:36,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (1/1) ... [2020-08-21 20:31:36,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 20:31:36,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 20:31:36,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 20:31:36,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 20:31:36,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 20:31:36,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 20:31:36,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 20:31:36,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-21 20:31:36,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 20:31:36,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 20:31:36,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 20:31:36,702 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-21 20:31:36,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 20:31:36,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 20:31:36,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 20:31:36,878 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 20:31:36,878 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 20:31:36,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 08:31:36 BoogieIcfgContainer [2020-08-21 20:31:36,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 20:31:36,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 20:31:36,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 20:31:36,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 20:31:36,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 08:31:36" (1/3) ... [2020-08-21 20:31:36,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4112ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 08:31:36, skipping insertion in model container [2020-08-21 20:31:36,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 08:31:36" (2/3) ... [2020-08-21 20:31:36,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4112ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 08:31:36, skipping insertion in model container [2020-08-21 20:31:36,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 08:31:36" (3/3) ... [2020-08-21 20:31:36,890 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-21 20:31:36,900 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 20:31:36,907 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 20:31:36,922 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 20:31:36,945 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 20:31:36,945 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 20:31:36,946 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 20:31:36,946 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 20:31:36,946 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 20:31:36,947 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 20:31:36,947 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 20:31:36,947 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 20:31:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-21 20:31:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 20:31:36,966 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:36,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:36,968 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-21 20:31:36,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:36,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342115210] [2020-08-21 20:31:36,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 20:31:37,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1342115210] [2020-08-21 20:31:37,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 20:31:37,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 20:31:37,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54300991] [2020-08-21 20:31:37,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 20:31:37,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 20:31:37,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 20:31:37,216 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-21 20:31:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:37,384 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 20:31:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 20:31:37,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 20:31:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:37,396 INFO L225 Difference]: With dead ends: 35 [2020-08-21 20:31:37,396 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 20:31:37,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 20:31:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 20:31:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 20:31:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 20:31:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 20:31:37,443 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 20:31:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:37,444 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 20:31:37,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 20:31:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 20:31:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 20:31:37,446 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:37,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:37,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 20:31:37,447 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-21 20:31:37,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:37,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1100396369] [2020-08-21 20:31:37,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 20:31:37,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1100396369] [2020-08-21 20:31:37,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 20:31:37,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 20:31:37,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989975808] [2020-08-21 20:31:37,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 20:31:37,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:37,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 20:31:37,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 20:31:37,528 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 20:31:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:37,597 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 20:31:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 20:31:37,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 20:31:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:37,599 INFO L225 Difference]: With dead ends: 27 [2020-08-21 20:31:37,599 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 20:31:37,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 20:31:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 20:31:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 20:31:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 20:31:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 20:31:37,609 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 20:31:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:37,609 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 20:31:37,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 20:31:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 20:31:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 20:31:37,611 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:37,612 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:37,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 20:31:37,612 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-21 20:31:37,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:37,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1357976461] [2020-08-21 20:31:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 20:31:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-21 20:31:37,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1357976461] [2020-08-21 20:31:37,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:37,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 20:31:37,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943807631] [2020-08-21 20:31:37,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 20:31:37,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 20:31:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 20:31:37,746 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-21 20:31:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:37,837 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 20:31:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 20:31:37,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 20:31:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:37,839 INFO L225 Difference]: With dead ends: 38 [2020-08-21 20:31:37,839 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 20:31:37,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-21 20:31:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 20:31:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 20:31:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 20:31:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 20:31:37,849 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 20:31:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:37,849 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 20:31:37,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 20:31:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 20:31:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 20:31:37,852 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:37,852 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:37,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 20:31:37,852 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:37,853 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-21 20:31:37,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:37,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [387613748] [2020-08-21 20:31:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-21 20:31:37,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [387613748] [2020-08-21 20:31:37,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:37,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 20:31:37,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678384875] [2020-08-21 20:31:37,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 20:31:37,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:37,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 20:31:37,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 20:31:37,990 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 20:31:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:38,118 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 20:31:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 20:31:38,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 20:31:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:38,121 INFO L225 Difference]: With dead ends: 41 [2020-08-21 20:31:38,121 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 20:31:38,122 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-21 20:31:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 20:31:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 20:31:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 20:31:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 20:31:38,134 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 20:31:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:38,135 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 20:31:38,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 20:31:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 20:31:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 20:31:38,137 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:38,137 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:38,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 20:31:38,138 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-21 20:31:38,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:38,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068286182] [2020-08-21 20:31:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-21 20:31:38,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068286182] [2020-08-21 20:31:38,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:38,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 20:31:38,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156862999] [2020-08-21 20:31:38,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 20:31:38,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:38,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 20:31:38,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 20:31:38,286 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-21 20:31:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:38,409 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-21 20:31:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 20:31:38,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-21 20:31:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:38,412 INFO L225 Difference]: With dead ends: 76 [2020-08-21 20:31:38,412 INFO L226 Difference]: Without dead ends: 45 [2020-08-21 20:31:38,414 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-21 20:31:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-21 20:31:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-21 20:31:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-21 20:31:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-21 20:31:38,426 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-21 20:31:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:38,427 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-21 20:31:38,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 20:31:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-21 20:31:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 20:31:38,429 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:38,430 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:38,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 20:31:38,430 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:38,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:38,431 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-21 20:31:38,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:38,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1030036882] [2020-08-21 20:31:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-21 20:31:38,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1030036882] [2020-08-21 20:31:38,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:38,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 20:31:38,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997813921] [2020-08-21 20:31:38,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 20:31:38,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:38,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 20:31:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 20:31:38,560 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-21 20:31:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:38,704 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-21 20:31:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 20:31:38,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 20:31:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:38,710 INFO L225 Difference]: With dead ends: 62 [2020-08-21 20:31:38,710 INFO L226 Difference]: Without dead ends: 58 [2020-08-21 20:31:38,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 20:31:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-21 20:31:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-21 20:31:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-21 20:31:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-21 20:31:38,738 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-21 20:31:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:38,738 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-21 20:31:38,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 20:31:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-21 20:31:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-21 20:31:38,747 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:38,747 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:38,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 20:31:38,747 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:38,752 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-21 20:31:38,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:38,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [374098331] [2020-08-21 20:31:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:38,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-21 20:31:39,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [374098331] [2020-08-21 20:31:39,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:39,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 20:31:39,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395769677] [2020-08-21 20:31:39,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 20:31:39,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:39,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 20:31:39,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 20:31:39,061 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-21 20:31:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:39,222 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-21 20:31:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 20:31:39,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-21 20:31:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:39,230 INFO L225 Difference]: With dead ends: 97 [2020-08-21 20:31:39,230 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 20:31:39,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-21 20:31:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 20:31:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-21 20:31:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-21 20:31:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-21 20:31:39,251 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-21 20:31:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:39,252 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-21 20:31:39,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 20:31:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-21 20:31:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-21 20:31:39,255 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:39,255 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:39,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 20:31:39,256 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:39,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-21 20:31:39,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:39,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448798618] [2020-08-21 20:31:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 20:31:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 20:31:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-21 20:31:39,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448798618] [2020-08-21 20:31:39,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:39,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-21 20:31:39,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228221832] [2020-08-21 20:31:39,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 20:31:39,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:39,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 20:31:39,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-21 20:31:39,674 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-21 20:31:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:40,136 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-21 20:31:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-21 20:31:40,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-21 20:31:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:40,138 INFO L225 Difference]: With dead ends: 153 [2020-08-21 20:31:40,139 INFO L226 Difference]: Without dead ends: 71 [2020-08-21 20:31:40,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-21 20:31:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-21 20:31:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-21 20:31:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-21 20:31:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-21 20:31:40,151 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-21 20:31:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:40,152 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-21 20:31:40,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 20:31:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-21 20:31:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-21 20:31:40,154 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:40,154 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:40,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 20:31:40,155 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-21 20:31:40,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:40,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [639866162] [2020-08-21 20:31:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 20:31:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-21 20:31:40,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [639866162] [2020-08-21 20:31:40,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:40,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 20:31:40,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240472878] [2020-08-21 20:31:40,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 20:31:40,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:40,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 20:31:40,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-21 20:31:40,414 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-21 20:31:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:40,579 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-21 20:31:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 20:31:40,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-21 20:31:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:40,581 INFO L225 Difference]: With dead ends: 68 [2020-08-21 20:31:40,581 INFO L226 Difference]: Without dead ends: 64 [2020-08-21 20:31:40,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-21 20:31:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-21 20:31:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-21 20:31:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-21 20:31:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-21 20:31:40,591 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-21 20:31:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:40,592 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-21 20:31:40,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 20:31:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-21 20:31:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 20:31:40,594 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:40,595 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:40,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 20:31:40,595 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-21 20:31:40,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:40,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [990154031] [2020-08-21 20:31:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 20:31:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 20:31:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-21 20:31:40,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [990154031] [2020-08-21 20:31:40,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:40,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 20:31:40,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681579124] [2020-08-21 20:31:40,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 20:31:40,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 20:31:40,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 20:31:40,993 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-21 20:31:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:41,224 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-21 20:31:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 20:31:41,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 20:31:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:41,228 INFO L225 Difference]: With dead ends: 180 [2020-08-21 20:31:41,228 INFO L226 Difference]: Without dead ends: 176 [2020-08-21 20:31:41,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-21 20:31:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-21 20:31:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-21 20:31:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-21 20:31:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-21 20:31:41,250 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-21 20:31:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:41,251 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-21 20:31:41,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 20:31:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-21 20:31:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-21 20:31:41,256 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:41,256 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:41,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 20:31:41,256 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-21 20:31:41,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:41,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515261912] [2020-08-21 20:31:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 20:31:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 20:31:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 20:31:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 20:31:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 20:31:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 20:31:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 20:31:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 20:31:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 20:31:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:41,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 20:31:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 20:31:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-21 20:31:42,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515261912] [2020-08-21 20:31:42,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 20:31:42,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 20:31:42,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334431690] [2020-08-21 20:31:42,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 20:31:42,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 20:31:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 20:31:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-21 20:31:42,065 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-21 20:31:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 20:31:42,348 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-21 20:31:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-21 20:31:42,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-21 20:31:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 20:31:42,354 INFO L225 Difference]: With dead ends: 410 [2020-08-21 20:31:42,355 INFO L226 Difference]: Without dead ends: 406 [2020-08-21 20:31:42,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-21 20:31:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-21 20:31:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-21 20:31:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-21 20:31:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-21 20:31:42,412 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-21 20:31:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 20:31:42,413 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-21 20:31:42,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 20:31:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-21 20:31:42,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-21 20:31:42,424 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 20:31:42,424 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 20:31:42,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 20:31:42,424 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 20:31:42,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 20:31:42,425 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-21 20:31:42,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 20:31:42,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [365477818] [2020-08-21 20:31:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 20:31:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 20:31:42,582 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 20:31:42,583 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 20:31:42,591 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 20:31:42,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 08:31:42 BoogieIcfgContainer [2020-08-21 20:31:42,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 20:31:42,672 INFO L168 Benchmark]: Toolchain (without parser) took 6418.60 ms. Allocated memory was 140.5 MB in the beginning and 364.9 MB in the end (delta: 224.4 MB). Free memory was 102.5 MB in the beginning and 139.4 MB in the end (delta: -36.9 MB). Peak memory consumption was 187.5 MB. Max. memory is 7.1 GB. [2020-08-21 20:31:42,676 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 20:31:42,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.13 ms. Allocated memory is still 140.5 MB. Free memory was 102.3 MB in the beginning and 92.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-08-21 20:31:42,679 INFO L168 Benchmark]: Boogie Preprocessor took 94.97 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 92.9 MB in the beginning and 182.1 MB in the end (delta: -89.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-08-21 20:31:42,679 INFO L168 Benchmark]: RCFGBuilder took 246.36 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 170.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2020-08-21 20:31:42,681 INFO L168 Benchmark]: TraceAbstraction took 5786.17 ms. Allocated memory was 202.9 MB in the beginning and 364.9 MB in the end (delta: 162.0 MB). Free memory was 169.4 MB in the beginning and 139.4 MB in the end (delta: 30.0 MB). Peak memory consumption was 192.0 MB. Max. memory is 7.1 GB. [2020-08-21 20:31:42,690 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 286.13 ms. Allocated memory is still 140.5 MB. Free memory was 102.3 MB in the beginning and 92.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.97 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 92.9 MB in the beginning and 182.1 MB in the end (delta: -89.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 246.36 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 170.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5786.17 ms. Allocated memory was 202.9 MB in the beginning and 364.9 MB in the end (delta: 162.0 MB). Free memory was 169.4 MB in the beginning and 139.4 MB in the end (delta: 30.0 MB). Peak memory consumption was 192.0 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: 5.6s, 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, 896 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s 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...