/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=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.2 --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 22:56:56,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 22:56:56,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 22:56:56,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 22:56:56,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 22:56:56,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 22:56:56,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 22:56:56,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 22:56:56,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 22:56:56,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 22:56:56,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 22:56:56,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 22:56:56,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 22:56:56,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 22:56:56,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 22:56:56,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 22:56:56,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 22:56:56,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 22:56:56,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 22:56:56,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 22:56:56,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 22:56:56,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 22:56:56,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 22:56:56,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 22:56:56,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 22:56:56,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 22:56:56,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 22:56:56,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 22:56:56,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 22:56:56,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 22:56:56,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 22:56:56,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 22:56:56,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 22:56:56,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 22:56:56,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 22:56:56,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 22:56:56,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 22:56:56,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 22:56:56,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 22:56:56,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 22:56:56,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 22:56:56,294 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 22:56:56,340 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 22:56:56,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 22:56:56,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 22:56:56,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 22:56:56,343 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 22:56:56,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 22:56:56,344 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 22:56:56,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 22:56:56,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 22:56:56,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 22:56:56,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 22:56:56,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 22:56:56,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 22:56:56,347 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 22:56:56,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 22:56:56,347 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 22:56:56,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 22:56:56,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 22:56:56,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 22:56:56,348 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 22:56:56,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 22:56:56,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 22:56:56,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 22:56:56,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 22:56:56,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 22:56:56,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 22:56:56,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 22:56:56,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 22:56:56,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 22:56:56,350 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=WIDESTAMONGSMALL;tolerance=0.2;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.2;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.2;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.2;log-additional-information=true; [2020-08-21 22:56:56,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 22:56:56,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 22:56:56,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 22:56:56,779 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 22:56:56,779 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 22:56:56,780 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 22:56:56,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/320ad8dbe/61c94b4256044de0a741d896a44aabe3/FLAG11c2c0def [2020-08-21 22:56:57,373 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 22:56:57,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 22:56:57,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/320ad8dbe/61c94b4256044de0a741d896a44aabe3/FLAG11c2c0def [2020-08-21 22:56:57,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/320ad8dbe/61c94b4256044de0a741d896a44aabe3 [2020-08-21 22:56:57,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 22:56:57,733 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 22:56:57,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 22:56:57,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 22:56:57,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 22:56:57,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:57,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784ce183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57, skipping insertion in model container [2020-08-21 22:56:57,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:57,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 22:56:57,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 22:56:57,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 22:56:57,956 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 22:56:57,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 22:56:57,981 INFO L208 MainTranslator]: Completed translation [2020-08-21 22:56:57,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57 WrapperNode [2020-08-21 22:56:57,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 22:56:57,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 22:56:57,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 22:56:57,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 22:56:57,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:57,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:58,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:58,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:58,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:58,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:58,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (1/1) ... [2020-08-21 22:56:58,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 22:56:58,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 22:56:58,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 22:56:58,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 22:56:58,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 22:56:58,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 22:56:58,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 22:56:58,162 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-21 22:56:58,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 22:56:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 22:56:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 22:56:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-21 22:56:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 22:56:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 22:56:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 22:56:58,345 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 22:56:58,345 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 22:56:58,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 10:56:58 BoogieIcfgContainer [2020-08-21 22:56:58,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 22:56:58,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 22:56:58,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 22:56:58,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 22:56:58,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 10:56:57" (1/3) ... [2020-08-21 22:56:58,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@932c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 10:56:58, skipping insertion in model container [2020-08-21 22:56:58,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:56:57" (2/3) ... [2020-08-21 22:56:58,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@932c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 10:56:58, skipping insertion in model container [2020-08-21 22:56:58,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 10:56:58" (3/3) ... [2020-08-21 22:56:58,363 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-21 22:56:58,374 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 22:56:58,384 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 22:56:58,400 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 22:56:58,431 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 22:56:58,431 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 22:56:58,431 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 22:56:58,431 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 22:56:58,432 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 22:56:58,432 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 22:56:58,432 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 22:56:58,432 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 22:56:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-21 22:56:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 22:56:58,456 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:56:58,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 22:56:58,457 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:56:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:56:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-21 22:56:58,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:56:58,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2101307634] [2020-08-21 22:56:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:56:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:58,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:56:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:58,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:56:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:58,696 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 22:56:58,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2101307634] [2020-08-21 22:56:58,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 22:56:58,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 22:56:58,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947309645] [2020-08-21 22:56:58,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 22:56:58,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:56:58,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 22:56:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 22:56:58,741 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-21 22:56:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:56:58,891 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 22:56:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 22:56:58,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 22:56:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:56:58,906 INFO L225 Difference]: With dead ends: 35 [2020-08-21 22:56:58,906 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 22:56:58,910 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 22:56:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 22:56:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 22:56:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 22:56:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 22:56:58,956 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 22:56:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:56:58,957 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 22:56:58,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 22:56:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 22:56:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 22:56:58,959 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:56:58,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 22:56:58,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 22:56:58,960 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:56:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:56:58,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-21 22:56:58,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:56:58,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [445868707] [2020-08-21 22:56:58,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:56:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:56:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:56:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,058 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 22:56:59,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [445868707] [2020-08-21 22:56:59,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 22:56:59,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 22:56:59,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352243281] [2020-08-21 22:56:59,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 22:56:59,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:56:59,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 22:56:59,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 22:56:59,063 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 22:56:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:56:59,137 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 22:56:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 22:56:59,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 22:56:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:56:59,140 INFO L225 Difference]: With dead ends: 27 [2020-08-21 22:56:59,140 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 22:56:59,141 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 22:56:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 22:56:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 22:56:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 22:56:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 22:56:59,150 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 22:56:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:56:59,150 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 22:56:59,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 22:56:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 22:56:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 22:56:59,152 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:56:59,152 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 22:56:59,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 22:56:59,153 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:56:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:56:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-21 22:56:59,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:56:59,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [471918834] [2020-08-21 22:56:59,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:56:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:56:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:56:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:56:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 22:56:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,274 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 22:56:59,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [471918834] [2020-08-21 22:56:59,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:56:59,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 22:56:59,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156521216] [2020-08-21 22:56:59,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 22:56:59,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:56:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 22:56:59,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 22:56:59,277 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-21 22:56:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:56:59,364 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 22:56:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 22:56:59,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 22:56:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:56:59,366 INFO L225 Difference]: With dead ends: 38 [2020-08-21 22:56:59,367 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 22:56:59,368 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 22:56:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 22:56:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 22:56:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 22:56:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 22:56:59,376 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 22:56:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:56:59,377 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 22:56:59,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 22:56:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 22:56:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 22:56:59,379 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:56:59,379 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 22:56:59,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 22:56:59,380 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:56:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:56:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-21 22:56:59,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:56:59,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675833075] [2020-08-21 22:56:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:56:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:56:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:56:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:56:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:56:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,523 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 22:56:59,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675833075] [2020-08-21 22:56:59,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:56:59,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 22:56:59,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260906566] [2020-08-21 22:56:59,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 22:56:59,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:56:59,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 22:56:59,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 22:56:59,527 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 22:56:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:56:59,644 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 22:56:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 22:56:59,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 22:56:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:56:59,647 INFO L225 Difference]: With dead ends: 41 [2020-08-21 22:56:59,647 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 22:56:59,648 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 22:56:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 22:56:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 22:56:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 22:56:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 22:56:59,660 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 22:56:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:56:59,660 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 22:56:59,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 22:56:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 22:56:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 22:56:59,663 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:56:59,663 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 22:56:59,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 22:56:59,663 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:56:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:56:59,664 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-21 22:56:59,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:56:59,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [959965854] [2020-08-21 22:56:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:56:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:56:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:56:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:56:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:56:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:56:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:56:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:56:59,824 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 22:56:59,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [959965854] [2020-08-21 22:56:59,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:56:59,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 22:56:59,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317451737] [2020-08-21 22:56:59,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 22:56:59,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:56:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 22:56:59,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 22:56:59,828 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-21 22:56:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:56:59,940 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-21 22:56:59,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 22:56:59,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-21 22:56:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:56:59,943 INFO L225 Difference]: With dead ends: 76 [2020-08-21 22:56:59,944 INFO L226 Difference]: Without dead ends: 45 [2020-08-21 22:56:59,945 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 22:56:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-21 22:56:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-21 22:56:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-21 22:56:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-21 22:56:59,957 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-21 22:56:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:56:59,958 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-21 22:56:59,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 22:56:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-21 22:56:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 22:56:59,961 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:56:59,961 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 22:56:59,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 22:56:59,961 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:56:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:56:59,962 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-21 22:56:59,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:56:59,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [975797143] [2020-08-21 22:56:59,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:56:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:57:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:57:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,111 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 22:57:00,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [975797143] [2020-08-21 22:57:00,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:57:00,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 22:57:00,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211547882] [2020-08-21 22:57:00,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 22:57:00,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:57:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 22:57:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 22:57:00,113 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-21 22:57:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:57:00,221 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-21 22:57:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 22:57:00,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 22:57:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:57:00,223 INFO L225 Difference]: With dead ends: 62 [2020-08-21 22:57:00,224 INFO L226 Difference]: Without dead ends: 58 [2020-08-21 22:57:00,225 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 22:57:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-21 22:57:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-21 22:57:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-21 22:57:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-21 22:57:00,239 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-21 22:57:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:57:00,240 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-21 22:57:00,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 22:57:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-21 22:57:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-21 22:57:00,244 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:57:00,245 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 22:57:00,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 22:57:00,245 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:57:00,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:57:00,246 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-21 22:57:00,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:57:00,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1550093361] [2020-08-21 22:57:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:57:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:57:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:57:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,515 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 22:57:00,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1550093361] [2020-08-21 22:57:00,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:57:00,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 22:57:00,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437215587] [2020-08-21 22:57:00,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 22:57:00,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:57:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 22:57:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 22:57:00,519 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-21 22:57:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:57:00,701 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-21 22:57:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 22:57:00,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-21 22:57:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:57:00,706 INFO L225 Difference]: With dead ends: 97 [2020-08-21 22:57:00,706 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 22:57:00,707 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 22:57:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 22:57:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-21 22:57:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-21 22:57:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-21 22:57:00,726 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-21 22:57:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:57:00,727 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-21 22:57:00,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 22:57:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-21 22:57:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-21 22:57:00,735 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:57:00,735 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 22:57:00,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 22:57:00,736 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:57:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:57:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-21 22:57:00,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:57:00,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076572463] [2020-08-21 22:57:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:57:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:57:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:57:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:00,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:57:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:57:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,316 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 22:57:01,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076572463] [2020-08-21 22:57:01,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:57:01,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-21 22:57:01,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384217114] [2020-08-21 22:57:01,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 22:57:01,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:57:01,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 22:57:01,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-21 22:57:01,319 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-21 22:57:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:57:01,743 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-21 22:57:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-21 22:57:01,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-21 22:57:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:57:01,746 INFO L225 Difference]: With dead ends: 153 [2020-08-21 22:57:01,746 INFO L226 Difference]: Without dead ends: 71 [2020-08-21 22:57:01,749 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 22:57:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-21 22:57:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-21 22:57:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-21 22:57:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-21 22:57:01,759 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-21 22:57:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:57:01,760 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-21 22:57:01,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 22:57:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-21 22:57:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-21 22:57:01,761 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:57:01,762 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 22:57:01,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 22:57:01,762 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:57:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:57:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-21 22:57:01,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:57:01,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1206803046] [2020-08-21 22:57:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:57:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:57:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:57:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:57:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:01,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,004 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 22:57:02,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1206803046] [2020-08-21 22:57:02,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:57:02,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 22:57:02,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884866445] [2020-08-21 22:57:02,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 22:57:02,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:57:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 22:57:02,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-21 22:57:02,007 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-21 22:57:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:57:02,187 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-21 22:57:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 22:57:02,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-21 22:57:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:57:02,189 INFO L225 Difference]: With dead ends: 68 [2020-08-21 22:57:02,190 INFO L226 Difference]: Without dead ends: 64 [2020-08-21 22:57:02,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-21 22:57:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-21 22:57:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-21 22:57:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-21 22:57:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-21 22:57:02,199 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-21 22:57:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:57:02,200 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-21 22:57:02,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 22:57:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-21 22:57:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 22:57:02,202 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:57:02,202 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 22:57:02,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 22:57:02,202 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:57:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:57:02,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-21 22:57:02,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:57:02,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624622410] [2020-08-21 22:57:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:57:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:57:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:57:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:57:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 22:57:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,596 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 22:57:02,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [624622410] [2020-08-21 22:57:02,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:57:02,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 22:57:02,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279338069] [2020-08-21 22:57:02,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 22:57:02,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:57:02,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 22:57:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 22:57:02,599 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-21 22:57:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:57:02,795 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-21 22:57:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 22:57:02,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 22:57:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:57:02,799 INFO L225 Difference]: With dead ends: 180 [2020-08-21 22:57:02,799 INFO L226 Difference]: Without dead ends: 176 [2020-08-21 22:57:02,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-21 22:57:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-21 22:57:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-21 22:57:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-21 22:57:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-21 22:57:02,822 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-21 22:57:02,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:57:02,823 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-21 22:57:02,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 22:57:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-21 22:57:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-21 22:57:02,830 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:57:02,830 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 22:57:02,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 22:57:02,831 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:57:02,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:57:02,831 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-21 22:57:02,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:57:02,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2114982589] [2020-08-21 22:57:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:57:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:57:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:02,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:57:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:57:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 22:57:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 22:57:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:57:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:57:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:57:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:57:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:57:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:57:03,641 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 22:57:03,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2114982589] [2020-08-21 22:57:03,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:57:03,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 22:57:03,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949274887] [2020-08-21 22:57:03,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 22:57:03,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:57:03,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 22:57:03,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-21 22:57:03,644 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-21 22:57:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:57:03,912 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-21 22:57:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-21 22:57:03,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-21 22:57:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:57:03,918 INFO L225 Difference]: With dead ends: 410 [2020-08-21 22:57:03,919 INFO L226 Difference]: Without dead ends: 406 [2020-08-21 22:57:03,920 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 22:57:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-21 22:57:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-21 22:57:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-21 22:57:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-21 22:57:03,960 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-21 22:57:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:57:03,961 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-21 22:57:03,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 22:57:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-21 22:57:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-21 22:57:03,971 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:57:03,971 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 22:57:03,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 22:57:03,971 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:57:03,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:57:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-21 22:57:03,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:57:03,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363732856] [2020-08-21 22:57:03,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:57:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 22:57:04,101 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 22:57:04,102 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 22:57:04,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 22:57:04,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 10:57:04 BoogieIcfgContainer [2020-08-21 22:57:04,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 22:57:04,170 INFO L168 Benchmark]: Toolchain (without parser) took 6436.59 ms. Allocated memory was 138.4 MB in the beginning and 379.1 MB in the end (delta: 240.6 MB). Free memory was 100.5 MB in the beginning and 268.7 MB in the end (delta: -168.3 MB). Peak memory consumption was 72.4 MB. Max. memory is 7.1 GB. [2020-08-21 22:57:04,176 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 22:57:04,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.21 ms. Allocated memory is still 138.4 MB. Free memory was 100.3 MB in the beginning and 91.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-21 22:57:04,179 INFO L168 Benchmark]: Boogie Preprocessor took 112.12 ms. Allocated memory was 138.4 MB in the beginning and 198.2 MB in the end (delta: 59.8 MB). Free memory was 91.0 MB in the beginning and 176.9 MB in the end (delta: -85.9 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-08-21 22:57:04,179 INFO L168 Benchmark]: RCFGBuilder took 254.80 ms. Allocated memory is still 198.2 MB. Free memory was 176.3 MB in the beginning and 164.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-08-21 22:57:04,182 INFO L168 Benchmark]: TraceAbstraction took 5813.32 ms. Allocated memory was 198.2 MB in the beginning and 379.1 MB in the end (delta: 180.9 MB). Free memory was 164.8 MB in the beginning and 268.7 MB in the end (delta: -103.9 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. [2020-08-21 22:57:04,193 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.84 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 248.21 ms. Allocated memory is still 138.4 MB. Free memory was 100.3 MB in the beginning and 91.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.12 ms. Allocated memory was 138.4 MB in the beginning and 198.2 MB in the end (delta: 59.8 MB). Free memory was 91.0 MB in the beginning and 176.9 MB in the end (delta: -85.9 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 254.80 ms. Allocated memory is still 198.2 MB. Free memory was 176.3 MB in the beginning and 164.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5813.32 ms. Allocated memory was 198.2 MB in the beginning and 379.1 MB in the end (delta: 180.9 MB). Free memory was 164.8 MB in the beginning and 268.7 MB in the end (delta: -103.9 MB). Peak memory consumption was 77.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.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 310 SDslu, 530 SDs, 0 SdLazy, 892 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 243366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 6018/8497 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...