/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.8 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_15x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 01:57:30,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 01:57:30,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 01:57:30,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 01:57:30,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 01:57:30,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 01:57:30,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 01:57:30,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 01:57:30,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 01:57:30,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 01:57:30,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 01:57:30,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 01:57:30,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 01:57:30,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 01:57:30,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 01:57:30,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 01:57:30,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 01:57:30,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 01:57:30,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 01:57:30,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 01:57:30,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 01:57:30,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 01:57:30,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 01:57:30,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 01:57:30,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 01:57:30,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 01:57:30,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 01:57:30,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 01:57:30,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 01:57:30,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 01:57:30,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 01:57:30,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 01:57:30,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 01:57:30,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 01:57:30,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 01:57:30,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 01:57:30,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 01:57:30,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 01:57:30,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 01:57:30,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 01:57:30,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 01:57:30,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 01:57:30,987 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 01:57:30,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 01:57:30,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 01:57:30,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 01:57:30,989 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 01:57:30,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 01:57:30,990 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 01:57:30,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 01:57:30,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 01:57:30,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 01:57:30,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 01:57:30,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 01:57:30,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 01:57:30,993 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 01:57:30,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 01:57:30,993 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 01:57:30,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 01:57:30,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 01:57:30,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 01:57:30,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 01:57:30,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 01:57:30,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 01:57:30,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 01:57:30,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 01:57:30,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 01:57:30,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 01:57:30,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 01:57:30,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 01:57:30,996 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 01:57:30,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8; [2020-08-19 01:57:31,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 01:57:31,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 01:57:31,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 01:57:31,301 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 01:57:31,302 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 01:57:31,303 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_15x0-2.c [2020-08-19 01:57:31,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/09e8f826e/270956eacbb14776a8b452e0e57d51c4/FLAGfb1a52076 [2020-08-19 01:57:31,865 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 01:57:31,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_15x0-2.c [2020-08-19 01:57:31,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/09e8f826e/270956eacbb14776a8b452e0e57d51c4/FLAGfb1a52076 [2020-08-19 01:57:32,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/09e8f826e/270956eacbb14776a8b452e0e57d51c4 [2020-08-19 01:57:32,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 01:57:32,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 01:57:32,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 01:57:32,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 01:57:32,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 01:57:32,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e8030c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32, skipping insertion in model container [2020-08-19 01:57:32,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 01:57:32,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 01:57:32,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 01:57:32,435 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 01:57:32,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 01:57:32,465 INFO L208 MainTranslator]: Completed translation [2020-08-19 01:57:32,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32 WrapperNode [2020-08-19 01:57:32,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 01:57:32,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 01:57:32,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 01:57:32,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 01:57:32,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 01:57:32,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 01:57:32,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 01:57:32,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 01:57:32,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 01:57:32,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 01:57:32,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 01:57:32,645 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-08-19 01:57:32,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 01:57:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 01:57:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-08-19 01:57:32,646 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 01:57:32,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 01:57:32,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 01:57:32,813 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 01:57:32,814 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 01:57:32,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 01:57:32 BoogieIcfgContainer [2020-08-19 01:57:32,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 01:57:32,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 01:57:32,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 01:57:32,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 01:57:32,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 01:57:32" (1/3) ... [2020-08-19 01:57:32,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f20b50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 01:57:32, skipping insertion in model container [2020-08-19 01:57:32,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (2/3) ... [2020-08-19 01:57:32,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f20b50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 01:57:32, skipping insertion in model container [2020-08-19 01:57:32,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 01:57:32" (3/3) ... [2020-08-19 01:57:32,827 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2020-08-19 01:57:32,838 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 01:57:32,846 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 01:57:32,860 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 01:57:32,888 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 01:57:32,888 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 01:57:32,888 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 01:57:32,888 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 01:57:32,889 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 01:57:32,889 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 01:57:32,889 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 01:57:32,889 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 01:57:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-19 01:57:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 01:57:32,927 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:32,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:32,929 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2020-08-19 01:57:32,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:32,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1142593074] [2020-08-19 01:57:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 01:57:33,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1142593074] [2020-08-19 01:57:33,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 01:57:33,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 01:57:33,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126599897] [2020-08-19 01:57:33,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 01:57:33,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:33,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 01:57:33,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 01:57:33,195 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-19 01:57:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:33,293 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-08-19 01:57:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 01:57:33,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 01:57:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:33,305 INFO L225 Difference]: With dead ends: 30 [2020-08-19 01:57:33,306 INFO L226 Difference]: Without dead ends: 18 [2020-08-19 01:57:33,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:57:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-19 01:57:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-19 01:57:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-19 01:57:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-19 01:57:33,353 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-19 01:57:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:33,354 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-19 01:57:33,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 01:57:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-19 01:57:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-19 01:57:33,356 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:33,357 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:33,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 01:57:33,358 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2020-08-19 01:57:33,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:33,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1209339507] [2020-08-19 01:57:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-19 01:57:33,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1209339507] [2020-08-19 01:57:33,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:33,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 01:57:33,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880660467] [2020-08-19 01:57:33,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 01:57:33,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:33,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 01:57:33,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:57:33,512 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-08-19 01:57:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:33,586 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-19 01:57:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 01:57:33,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-08-19 01:57:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:33,588 INFO L225 Difference]: With dead ends: 25 [2020-08-19 01:57:33,589 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 01:57:33,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-19 01:57:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 01:57:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 01:57:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 01:57:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-19 01:57:33,598 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-19 01:57:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:33,598 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-19 01:57:33,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 01:57:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-19 01:57:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-19 01:57:33,600 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:33,600 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:33,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 01:57:33,601 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:33,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:33,601 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2020-08-19 01:57:33,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:33,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [383267783] [2020-08-19 01:57:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-19 01:57:33,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [383267783] [2020-08-19 01:57:33,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:33,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 01:57:33,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309923332] [2020-08-19 01:57:33,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 01:57:33,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 01:57:33,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 01:57:33,843 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-08-19 01:57:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:33,922 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-19 01:57:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 01:57:33,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-08-19 01:57:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:33,924 INFO L225 Difference]: With dead ends: 28 [2020-08-19 01:57:33,924 INFO L226 Difference]: Without dead ends: 24 [2020-08-19 01:57:33,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:57:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-19 01:57:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-19 01:57:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-19 01:57:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-19 01:57:33,933 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-19 01:57:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:33,933 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-19 01:57:33,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 01:57:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-19 01:57:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-19 01:57:33,935 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:33,935 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:33,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 01:57:33,936 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2020-08-19 01:57:33,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:33,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862016038] [2020-08-19 01:57:33,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-19 01:57:34,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1862016038] [2020-08-19 01:57:34,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:34,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 01:57:34,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441362400] [2020-08-19 01:57:34,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 01:57:34,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:34,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 01:57:34,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 01:57:34,144 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-08-19 01:57:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:34,220 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-19 01:57:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 01:57:34,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-08-19 01:57:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:34,223 INFO L225 Difference]: With dead ends: 31 [2020-08-19 01:57:34,223 INFO L226 Difference]: Without dead ends: 27 [2020-08-19 01:57:34,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-19 01:57:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-19 01:57:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-19 01:57:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-19 01:57:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-19 01:57:34,230 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-19 01:57:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:34,231 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-19 01:57:34,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 01:57:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-19 01:57:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-19 01:57:34,233 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:34,233 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:34,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 01:57:34,233 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:34,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:34,234 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2020-08-19 01:57:34,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:34,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2024263425] [2020-08-19 01:57:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-19 01:57:34,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2024263425] [2020-08-19 01:57:34,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:34,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 01:57:34,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960114361] [2020-08-19 01:57:34,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 01:57:34,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 01:57:34,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 01:57:34,396 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-08-19 01:57:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:34,479 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-19 01:57:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 01:57:34,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-08-19 01:57:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:34,481 INFO L225 Difference]: With dead ends: 34 [2020-08-19 01:57:34,481 INFO L226 Difference]: Without dead ends: 30 [2020-08-19 01:57:34,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-19 01:57:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-19 01:57:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-19 01:57:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 01:57:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-19 01:57:34,489 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-19 01:57:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:34,489 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-19 01:57:34,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 01:57:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-19 01:57:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-19 01:57:34,491 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:34,491 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:34,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 01:57:34,492 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:34,492 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2020-08-19 01:57:34,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:34,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338660994] [2020-08-19 01:57:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-19 01:57:34,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338660994] [2020-08-19 01:57:34,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:34,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 01:57:34,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160079388] [2020-08-19 01:57:34,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 01:57:34,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:34,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 01:57:34,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:57:34,691 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-08-19 01:57:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:34,795 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-19 01:57:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 01:57:34,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-08-19 01:57:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:34,797 INFO L225 Difference]: With dead ends: 37 [2020-08-19 01:57:34,797 INFO L226 Difference]: Without dead ends: 33 [2020-08-19 01:57:34,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 01:57:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-19 01:57:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-19 01:57:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-19 01:57:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-19 01:57:34,805 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-19 01:57:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:34,806 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-19 01:57:34,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 01:57:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-19 01:57:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-19 01:57:34,808 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:34,808 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:34,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 01:57:34,809 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:34,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2020-08-19 01:57:34,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:34,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2098920627] [2020-08-19 01:57:34,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-19 01:57:35,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2098920627] [2020-08-19 01:57:35,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:35,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 01:57:35,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231122442] [2020-08-19 01:57:35,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 01:57:35,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:35,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 01:57:35,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 01:57:35,031 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-08-19 01:57:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:35,146 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-19 01:57:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 01:57:35,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-08-19 01:57:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:35,148 INFO L225 Difference]: With dead ends: 40 [2020-08-19 01:57:35,148 INFO L226 Difference]: Without dead ends: 36 [2020-08-19 01:57:35,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-19 01:57:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-19 01:57:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-19 01:57:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-19 01:57:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-19 01:57:35,155 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-19 01:57:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:35,155 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-19 01:57:35,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 01:57:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-19 01:57:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-19 01:57:35,157 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:35,157 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:35,157 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 01:57:35,158 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2020-08-19 01:57:35,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:35,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28455932] [2020-08-19 01:57:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-19 01:57:35,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28455932] [2020-08-19 01:57:35,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:35,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 01:57:35,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98554058] [2020-08-19 01:57:35,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 01:57:35,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:35,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 01:57:35,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-08-19 01:57:35,378 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-08-19 01:57:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:35,505 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-19 01:57:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 01:57:35,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-08-19 01:57:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:35,507 INFO L225 Difference]: With dead ends: 43 [2020-08-19 01:57:35,507 INFO L226 Difference]: Without dead ends: 39 [2020-08-19 01:57:35,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-08-19 01:57:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-19 01:57:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-19 01:57:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 01:57:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-19 01:57:35,514 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-19 01:57:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:35,515 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-19 01:57:35,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 01:57:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-19 01:57:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-19 01:57:35,516 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:35,516 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:35,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 01:57:35,517 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:35,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:35,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2020-08-19 01:57:35,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:35,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584281685] [2020-08-19 01:57:35,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-08-19 01:57:35,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584281685] [2020-08-19 01:57:35,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:35,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 01:57:35,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983002393] [2020-08-19 01:57:35,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 01:57:35,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 01:57:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-19 01:57:35,785 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-08-19 01:57:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:35,919 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-19 01:57:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 01:57:35,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-08-19 01:57:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:35,921 INFO L225 Difference]: With dead ends: 46 [2020-08-19 01:57:35,921 INFO L226 Difference]: Without dead ends: 42 [2020-08-19 01:57:35,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-19 01:57:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-19 01:57:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-19 01:57:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-19 01:57:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-19 01:57:35,929 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-19 01:57:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:35,930 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-19 01:57:35,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 01:57:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-19 01:57:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-19 01:57:35,932 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:35,932 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:35,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 01:57:35,932 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2020-08-19 01:57:35,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:35,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1133536582] [2020-08-19 01:57:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-19 01:57:36,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1133536582] [2020-08-19 01:57:36,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:36,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-19 01:57:36,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978878179] [2020-08-19 01:57:36,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-19 01:57:36,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-19 01:57:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-08-19 01:57:36,281 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-08-19 01:57:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:36,429 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-19 01:57:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 01:57:36,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-08-19 01:57:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:36,431 INFO L225 Difference]: With dead ends: 49 [2020-08-19 01:57:36,431 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 01:57:36,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-08-19 01:57:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 01:57:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-19 01:57:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-19 01:57:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-19 01:57:36,438 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-19 01:57:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:36,439 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-19 01:57:36,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-19 01:57:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-19 01:57:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-19 01:57:36,440 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:36,441 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:36,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 01:57:36,441 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:36,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:36,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2020-08-19 01:57:36,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:36,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344788616] [2020-08-19 01:57:36,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-19 01:57:36,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344788616] [2020-08-19 01:57:36,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:36,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-19 01:57:36,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765050989] [2020-08-19 01:57:36,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-19 01:57:36,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-19 01:57:36,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-08-19 01:57:36,812 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-08-19 01:57:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:36,965 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-19 01:57:36,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-19 01:57:36,965 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-08-19 01:57:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:36,967 INFO L225 Difference]: With dead ends: 52 [2020-08-19 01:57:36,967 INFO L226 Difference]: Without dead ends: 48 [2020-08-19 01:57:36,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-08-19 01:57:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-19 01:57:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-19 01:57:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-19 01:57:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-19 01:57:36,974 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-19 01:57:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:36,975 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-19 01:57:36,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-19 01:57:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-19 01:57:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-19 01:57:36,976 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:36,976 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:36,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 01:57:36,977 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2020-08-19 01:57:36,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:36,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1471314540] [2020-08-19 01:57:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-08-19 01:57:37,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1471314540] [2020-08-19 01:57:37,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:37,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-19 01:57:37,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862143188] [2020-08-19 01:57:37,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-19 01:57:37,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-19 01:57:37,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-08-19 01:57:37,403 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-08-19 01:57:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:37,618 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-19 01:57:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 01:57:37,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-08-19 01:57:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:37,620 INFO L225 Difference]: With dead ends: 55 [2020-08-19 01:57:37,620 INFO L226 Difference]: Without dead ends: 51 [2020-08-19 01:57:37,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-08-19 01:57:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-19 01:57:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-19 01:57:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-19 01:57:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-19 01:57:37,628 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-19 01:57:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:37,629 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-19 01:57:37,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-19 01:57:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-19 01:57:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-19 01:57:37,630 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:37,630 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:37,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 01:57:37,631 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:37,632 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2020-08-19 01:57:37,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:37,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1033299813] [2020-08-19 01:57:37,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-08-19 01:57:38,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1033299813] [2020-08-19 01:57:38,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:38,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-19 01:57:38,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268575888] [2020-08-19 01:57:38,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-19 01:57:38,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-19 01:57:38,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-08-19 01:57:38,100 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-08-19 01:57:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:38,305 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-19 01:57:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-19 01:57:38,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-08-19 01:57:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:38,309 INFO L225 Difference]: With dead ends: 58 [2020-08-19 01:57:38,309 INFO L226 Difference]: Without dead ends: 54 [2020-08-19 01:57:38,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-08-19 01:57:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-19 01:57:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-19 01:57:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 01:57:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-19 01:57:38,323 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-19 01:57:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:38,325 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-19 01:57:38,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-19 01:57:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-19 01:57:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-19 01:57:38,326 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:38,327 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:38,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 01:57:38,328 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:38,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:38,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2020-08-19 01:57:38,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:38,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1581599736] [2020-08-19 01:57:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-08-19 01:57:38,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1581599736] [2020-08-19 01:57:38,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:38,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-19 01:57:38,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431236117] [2020-08-19 01:57:38,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-19 01:57:38,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-19 01:57:38,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-08-19 01:57:38,952 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-08-19 01:57:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:39,235 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-19 01:57:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-19 01:57:39,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-08-19 01:57:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:39,237 INFO L225 Difference]: With dead ends: 61 [2020-08-19 01:57:39,237 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 01:57:39,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-08-19 01:57:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 01:57:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-19 01:57:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-19 01:57:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-19 01:57:39,245 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-19 01:57:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:39,245 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-19 01:57:39,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-19 01:57:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-19 01:57:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-19 01:57:39,247 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:39,247 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:39,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 01:57:39,248 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2020-08-19 01:57:39,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:39,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2119723733] [2020-08-19 01:57:39,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-08-19 01:57:39,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2119723733] [2020-08-19 01:57:39,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:39,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-19 01:57:39,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475295210] [2020-08-19 01:57:39,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-19 01:57:39,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:39,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-19 01:57:39,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-08-19 01:57:39,862 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-08-19 01:57:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:40,107 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-19 01:57:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-19 01:57:40,107 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-08-19 01:57:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:40,108 INFO L225 Difference]: With dead ends: 64 [2020-08-19 01:57:40,108 INFO L226 Difference]: Without dead ends: 60 [2020-08-19 01:57:40,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-08-19 01:57:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-19 01:57:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-19 01:57:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-19 01:57:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-19 01:57:40,120 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-19 01:57:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:40,121 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-19 01:57:40,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-19 01:57:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-19 01:57:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-19 01:57:40,123 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:40,123 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:40,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-19 01:57:40,124 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:40,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2020-08-19 01:57:40,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:40,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067990080] [2020-08-19 01:57:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 01:57:40,154 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 01:57:40,156 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 01:57:40,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-19 01:57:40,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 01:57:40 BoogieIcfgContainer [2020-08-19 01:57:40,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 01:57:40,221 INFO L168 Benchmark]: Toolchain (without parser) took 7977.15 ms. Allocated memory was 141.0 MB in the beginning and 335.0 MB in the end (delta: 194.0 MB). Free memory was 102.8 MB in the beginning and 213.7 MB in the end (delta: -110.8 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:40,222 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-19 01:57:40,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.11 ms. Allocated memory is still 141.0 MB. Free memory was 102.6 MB in the beginning and 93.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:40,223 INFO L168 Benchmark]: Boogie Preprocessor took 116.47 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 93.3 MB in the beginning and 184.2 MB in the end (delta: -90.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:40,225 INFO L168 Benchmark]: RCFGBuilder took 234.64 ms. Allocated memory is still 205.0 MB. Free memory was 184.2 MB in the beginning and 173.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:40,227 INFO L168 Benchmark]: TraceAbstraction took 7398.96 ms. Allocated memory was 205.0 MB in the beginning and 335.0 MB in the end (delta: 130.0 MB). Free memory was 172.4 MB in the beginning and 213.7 MB in the end (delta: -41.3 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:40,230 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 222.11 ms. Allocated memory is still 141.0 MB. Free memory was 102.6 MB in the beginning and 93.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.47 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 93.3 MB in the beginning and 184.2 MB in the end (delta: -90.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 234.64 ms. Allocated memory is still 205.0 MB. Free memory was 184.2 MB in the beginning and 173.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7398.96 ms. Allocated memory was 205.0 MB in the beginning and 335.0 MB in the end (delta: 130.0 MB). Free memory was 172.4 MB in the beginning and 213.7 MB in the end (delta: -41.3 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 15; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND TRUE n <= 0 [L5] return m + n; [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.2s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 183 SDtfs, 318 SDslu, 711 SDs, 0 SdLazy, 522 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=15, 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 928 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 133800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 1575/3150 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...