/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:30:00,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:30:00,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:30:00,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:30:00,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:30:00,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:30:00,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:30:00,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:30:00,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:30:00,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:30:00,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:30:00,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:30:00,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:30:00,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:30:00,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:30:00,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:30:00,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:30:00,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:30:00,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:30:00,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:30:00,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:30:00,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:30:00,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:30:00,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:30:00,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:30:00,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:30:00,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:30:00,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:30:00,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:30:00,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:30:00,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:30:00,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:30:00,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:30:00,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:30:00,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:30:00,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:30:00,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:30:00,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:30:00,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:30:00,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:30:00,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:30:00,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:30:00,696 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:30:00,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:30:00,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:30:00,699 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:30:00,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:30:00,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:30:00,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:30:00,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:30:00,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:30:00,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:30:00,701 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:30:00,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:30:00,701 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:30:00,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:30:00,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:30:00,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:30:00,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:30:00,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:30:00,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:30:00,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:30:00,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:30:00,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:30:00,702 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:30:00,702 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:30:01,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:30:01,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:30:01,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:30:01,036 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:30:01,037 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:30:01,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2021-05-02 23:30:01,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90264a0f4/1cc963ed5f4d480fbf77a05b176b298e/FLAG9947a01ac [2021-05-02 23:30:01,513 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:30:01,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2021-05-02 23:30:01,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90264a0f4/1cc963ed5f4d480fbf77a05b176b298e/FLAG9947a01ac [2021-05-02 23:30:01,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90264a0f4/1cc963ed5f4d480fbf77a05b176b298e [2021-05-02 23:30:01,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:30:01,933 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:30:01,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:30:01,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:30:01,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:30:01,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:30:01" (1/1) ... [2021-05-02 23:30:01,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c0c00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:01, skipping insertion in model container [2021-05-02 23:30:01,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:30:01" (1/1) ... [2021-05-02 23:30:01,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:30:01,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:30:02,079 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2021-05-02 23:30:02,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:30:02,140 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:30:02,175 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2021-05-02 23:30:02,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:30:02,199 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:30:02,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02 WrapperNode [2021-05-02 23:30:02,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:30:02,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:30:02,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:30:02,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:30:02,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (1/1) ... [2021-05-02 23:30:02,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (1/1) ... [2021-05-02 23:30:02,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (1/1) ... [2021-05-02 23:30:02,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (1/1) ... [2021-05-02 23:30:02,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (1/1) ... [2021-05-02 23:30:02,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (1/1) ... [2021-05-02 23:30:02,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (1/1) ... [2021-05-02 23:30:02,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:30:02,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:30:02,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:30:02,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:30:02,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2021-05-02 23:30:02,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:30:02,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:30:02,320 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:30:02,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:30:02,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:30:02,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:30:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:30:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:30:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:30:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:30:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:30:02,617 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:30:02,617 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 23:30:02,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:30:02 BoogieIcfgContainer [2021-05-02 23:30:02,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:30:02,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:30:02,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:30:02,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:30:02,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:30:01" (1/3) ... [2021-05-02 23:30:02,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f63dd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:30:02, skipping insertion in model container [2021-05-02 23:30:02,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:02" (2/3) ... [2021-05-02 23:30:02,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f63dd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:30:02, skipping insertion in model container [2021-05-02 23:30:02,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:30:02" (3/3) ... [2021-05-02 23:30:02,625 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2021-05-02 23:30:02,630 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:30:02,633 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:30:02,648 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:30:02,663 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:30:02,664 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:30:02,664 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:30:02,664 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:30:02,664 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:30:02,664 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:30:02,664 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:30:02,664 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:30:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:30:02,683 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:02,683 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:02,684 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:02,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2021-05-02 23:30:02,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:02,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1722950588] [2021-05-02 23:30:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:02,778 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:03,098 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:03,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1722950588] [2021-05-02 23:30:03,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1722950588] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:03,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:03,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:03,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777289502] [2021-05-02 23:30:03,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:03,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:03,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:03,119 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:03,693 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2021-05-02 23:30:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:03,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-02 23:30:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:03,704 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:30:03,704 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:30:03,710 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 201.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:30:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2021-05-02 23:30:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2021-05-02 23:30:03,777 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2021-05-02 23:30:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:03,778 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2021-05-02 23:30:03,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2021-05-02 23:30:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:30:03,780 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:03,780 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:03,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:30:03,781 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:03,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2021-05-02 23:30:03,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:03,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [833922644] [2021-05-02 23:30:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:03,791 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:03,859 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:03,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [833922644] [2021-05-02 23:30:03,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [833922644] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:03,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:03,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:03,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384168507] [2021-05-02 23:30:03,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:03,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:03,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:03,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:03,862 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:04,130 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2021-05-02 23:30:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:04,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-02 23:30:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:04,133 INFO L225 Difference]: With dead ends: 55 [2021-05-02 23:30:04,134 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:30:04,135 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 96.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:30:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-05-02 23:30:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2021-05-02 23:30:04,145 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2021-05-02 23:30:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:04,146 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2021-05-02 23:30:04,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2021-05-02 23:30:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:30:04,146 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:04,147 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:04,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:30:04,147 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2021-05-02 23:30:04,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:04,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [111654276] [2021-05-02 23:30:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:04,150 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 23:30:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:04,246 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:04,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [111654276] [2021-05-02 23:30:04,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [111654276] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:04,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:04,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:04,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763242458] [2021-05-02 23:30:04,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:04,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:04,248 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:30:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:04,537 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2021-05-02 23:30:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-05-02 23:30:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:04,538 INFO L225 Difference]: With dead ends: 57 [2021-05-02 23:30:04,538 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 23:30:04,539 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 92.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 23:30:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-02 23:30:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2021-05-02 23:30:04,549 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2021-05-02 23:30:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:04,549 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2021-05-02 23:30:04,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:30:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2021-05-02 23:30:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 23:30:04,550 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:04,550 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:04,550 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:30:04,551 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2021-05-02 23:30:04,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:04,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1963351828] [2021-05-02 23:30:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:04,553 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 23:30:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 23:30:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:04,624 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:04,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1963351828] [2021-05-02 23:30:04,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1963351828] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:04,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:04,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:04,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149982112] [2021-05-02 23:30:04,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:04,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:04,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:04,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:04,629 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 23:30:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:04,930 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2021-05-02 23:30:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:30:04,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-05-02 23:30:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:04,932 INFO L225 Difference]: With dead ends: 61 [2021-05-02 23:30:04,932 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:30:04,933 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 118.2ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:30:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:30:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 23:30:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2021-05-02 23:30:04,943 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2021-05-02 23:30:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:04,943 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2021-05-02 23:30:04,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 23:30:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2021-05-02 23:30:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:30:04,944 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:04,944 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:04,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:30:04,944 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:04,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2021-05-02 23:30:04,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:04,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [549283243] [2021-05-02 23:30:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:04,947 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 23:30:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 23:30:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-05-02 23:30:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:05,038 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:05,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [549283243] [2021-05-02 23:30:05,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [549283243] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:05,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:05,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:05,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844175252] [2021-05-02 23:30:05,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:05,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:05,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:05,039 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 23:30:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:05,294 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2021-05-02 23:30:05,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:05,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-05-02 23:30:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:05,296 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:30:05,296 INFO L226 Difference]: Without dead ends: 64 [2021-05-02 23:30:05,296 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 91.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-02 23:30:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2021-05-02 23:30:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2021-05-02 23:30:05,315 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2021-05-02 23:30:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:05,315 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2021-05-02 23:30:05,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 23:30:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2021-05-02 23:30:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:30:05,316 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:05,316 INFO L523 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:05,316 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:30:05,316 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:05,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2021-05-02 23:30:05,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:05,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1715753300] [2021-05-02 23:30:05,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:05,319 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 23:30:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 23:30:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 23:30:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 23:30:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-02 23:30:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-02 23:30:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-02 23:30:05,446 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:05,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1715753300] [2021-05-02 23:30:05,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1715753300] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:05,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:05,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:05,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501624786] [2021-05-02 23:30:05,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:05,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:05,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:05,448 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-02 23:30:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:05,750 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2021-05-02 23:30:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:30:05,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2021-05-02 23:30:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:05,753 INFO L225 Difference]: With dead ends: 75 [2021-05-02 23:30:05,753 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:30:05,754 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 122.8ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:30:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:30:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2021-05-02 23:30:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2021-05-02 23:30:05,776 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2021-05-02 23:30:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:05,778 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2021-05-02 23:30:05,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-02 23:30:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2021-05-02 23:30:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 23:30:05,784 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:05,785 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:05,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:30:05,786 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2021-05-02 23:30:05,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:05,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1162943975] [2021-05-02 23:30:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:05,789 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 23:30:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 23:30:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 23:30:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 23:30:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-02 23:30:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-02 23:30:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-02 23:30:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-02 23:30:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 23:30:05,964 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:05,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1162943975] [2021-05-02 23:30:05,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1162943975] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:05,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:05,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:30:05,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966123404] [2021-05-02 23:30:05,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:30:05,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:30:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:30:05,971 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-02 23:30:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:06,270 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2021-05-02 23:30:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:30:06,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2021-05-02 23:30:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:06,274 INFO L225 Difference]: With dead ends: 75 [2021-05-02 23:30:06,275 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:30:06,276 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 148.9ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:30:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:30:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-05-02 23:30:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2021-05-02 23:30:06,306 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2021-05-02 23:30:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:06,307 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2021-05-02 23:30:06,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-02 23:30:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2021-05-02 23:30:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:30:06,312 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:06,313 INFO L523 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:06,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:30:06,313 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2021-05-02 23:30:06,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:06,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [796780876] [2021-05-02 23:30:06,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:06,315 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 23:30:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 23:30:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 23:30:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 23:30:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-02 23:30:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-02 23:30:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-02 23:30:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-02 23:30:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-02 23:30:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-02 23:30:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-05-02 23:30:06,434 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:06,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [796780876] [2021-05-02 23:30:06,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [796780876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:06,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:06,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:30:06,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225171148] [2021-05-02 23:30:06,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:30:06,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:30:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:06,435 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-05-02 23:30:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:06,754 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2021-05-02 23:30:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:30:06,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2021-05-02 23:30:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:06,758 INFO L225 Difference]: With dead ends: 73 [2021-05-02 23:30:06,758 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:30:06,761 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 156.6ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:30:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:30:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:30:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 23:30:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:30:06,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2021-05-02 23:30:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:06,762 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:30:06,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-05-02 23:30:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:30:06,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:30:06,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:30:06,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:30:07,751 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 23:30:07,751 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 23:30:07,751 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 23:30:07,751 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:30:07,752 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-02 23:30:07,752 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:30:07,752 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:30:07,752 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:30:07,752 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:30:07,752 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:30:07,752 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 23:30:07,752 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:30:07,752 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:30:07,752 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:30:07,752 INFO L194 CegarLoopUtils]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,752 INFO L201 CegarLoopUtils]: At program point L31(line 31) the Hoare annotation is: true [2021-05-02 23:30:07,752 INFO L194 CegarLoopUtils]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,752 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 67) the Hoare annotation is: true [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L36(lines 36 63) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,753 INFO L194 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 67) the Hoare annotation is: true [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L201 CegarLoopUtils]: At program point L34-3(lines 34 65) the Hoare annotation is: true [2021-05-02 23:30:07,754 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,754 INFO L194 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,755 INFO L194 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 23:30:07,755 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:30:07,755 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 23:30:07,755 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:30:07,755 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:30:07,755 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:30:07,755 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:30:07,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:30:07 BoogieIcfgContainer [2021-05-02 23:30:07,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:30:07,772 INFO L168 Benchmark]: Toolchain (without parser) took 5838.68 ms. Allocated memory was 204.5 MB in the beginning and 311.4 MB in the end (delta: 107.0 MB). Free memory was 169.2 MB in the beginning and 211.9 MB in the end (delta: -42.7 MB). Peak memory consumption was 134.3 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:07,772 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 204.5 MB. Free memory is still 185.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:30:07,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.67 ms. Allocated memory is still 204.5 MB. Free memory was 169.0 MB in the beginning and 185.6 MB in the end (delta: -16.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:07,772 INFO L168 Benchmark]: Boogie Preprocessor took 41.96 ms. Allocated memory is still 204.5 MB. Free memory was 185.6 MB in the beginning and 183.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:07,773 INFO L168 Benchmark]: RCFGBuilder took 374.71 ms. Allocated memory is still 204.5 MB. Free memory was 183.9 MB in the beginning and 166.6 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:07,773 INFO L168 Benchmark]: TraceAbstraction took 5151.21 ms. Allocated memory was 204.5 MB in the beginning and 311.4 MB in the end (delta: 107.0 MB). Free memory was 166.1 MB in the beginning and 211.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 131.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:07,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 204.5 MB. Free memory is still 185.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 262.67 ms. Allocated memory is still 204.5 MB. Free memory was 169.0 MB in the beginning and 185.6 MB in the end (delta: -16.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.96 ms. Allocated memory is still 204.5 MB. Free memory was 185.6 MB in the beginning and 183.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 374.71 ms. Allocated memory is still 204.5 MB. Free memory was 183.9 MB in the beginning and 166.6 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5151.21 ms. Allocated memory was 204.5 MB in the beginning and 311.4 MB in the end (delta: 107.0 MB). Free memory was 166.1 MB in the beginning and 211.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 131.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4101.7ms, OverallIterations: 8, TraceHistogramMax: 11, EmptinessCheckTime: 24.2ms, AutomataDifference: 2671.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 987.0ms, InitialAbstractionConstructionTime: 9.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 286 SDtfs, 248 SDslu, 495 SDs, 0 SdLazy, 1159 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1244.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1028.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 153.5ms AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 43 LocationsWithAnnotation, 235 PreInvPairs, 302 NumberOfFragments, 567 HoareAnnotationTreeSize, 235 FomulaSimplifications, 3399 FormulaSimplificationTreeSizeReduction, 263.1ms HoareSimplificationTime, 43 FomulaSimplificationsInter, 1104 FormulaSimplificationTreeSizeReductionInter, 681.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i < len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! Received shutdown request...