/usr/bin/java -ea -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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/down.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:30:24,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:30:24,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:30:24,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:30:24,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:30:24,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:30:24,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:30:24,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:30:24,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:30:24,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:30:24,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:30:24,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:30:24,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:30:24,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:30:24,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:30:24,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:30:24,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:30:24,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:30:24,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:30:24,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:30:24,783 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:30:24,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:30:24,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:30:24,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:30:24,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:30:24,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:30:24,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:30:24,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:30:24,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:30:24,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:30:24,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:30:24,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:30:24,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:30:24,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:30:24,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:30:24,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:30:24,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:30:24,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:30:24,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:30:24,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:30:24,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:30:24,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:30:24,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:30:24,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:30:24,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:30:24,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:30:24,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:30:24,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:30:24,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:30:24,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:30:24,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:30:24,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:30:24,807 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:30:24,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:30:24,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:30:24,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:30:24,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:30:24,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:30:24,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:30:24,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:30:24,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:30:24,808 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:30:24,808 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:30:24,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:30:24,808 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:30:24,808 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; [2022-04-15 12:30:25,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:30:25,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:30:25,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:30:25,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:30:25,037 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:30:25,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/down.i [2022-04-15 12:30:25,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ef02998/649fcdd4a93b4e1da9f6074781d9762f/FLAG819b2ab31 [2022-04-15 12:30:25,450 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:30:25,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down.i [2022-04-15 12:30:25,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ef02998/649fcdd4a93b4e1da9f6074781d9762f/FLAG819b2ab31 [2022-04-15 12:30:25,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ef02998/649fcdd4a93b4e1da9f6074781d9762f [2022-04-15 12:30:25,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:30:25,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:30:25,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:30:25,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:30:25,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:30:25,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e459710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25, skipping insertion in model container [2022-04-15 12:30:25,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:30:25,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:30:25,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down.i[893,906] [2022-04-15 12:30:25,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:30:25,646 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:30:25,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down.i[893,906] [2022-04-15 12:30:25,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:30:25,675 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:30:25,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25 WrapperNode [2022-04-15 12:30:25,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:30:25,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:30:25,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:30:25,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:30:25,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:30:25,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:30:25,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:30:25,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:30:25,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (1/1) ... [2022-04-15 12:30:25,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:30:25,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:30:25,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:30:25,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:30:25,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:30:25,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:30:25,764 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:30:25,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:30:25,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:30:25,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:30:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:30:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:30:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:30:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:30:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:30:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:30:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:30:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:30:25,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:30:25,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:30:25,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:30:25,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:30:25,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:30:25,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:30:25,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:30:25,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:30:25,827 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:30:25,828 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:30:26,008 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:30:26,015 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:30:26,015 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:30:26,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:30:26 BoogieIcfgContainer [2022-04-15 12:30:26,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:30:26,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:30:26,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:30:26,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:30:26,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:30:25" (1/3) ... [2022-04-15 12:30:26,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fd606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:30:26, skipping insertion in model container [2022-04-15 12:30:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:25" (2/3) ... [2022-04-15 12:30:26,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fd606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:30:26, skipping insertion in model container [2022-04-15 12:30:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:30:26" (3/3) ... [2022-04-15 12:30:26,023 INFO L111 eAbstractionObserver]: Analyzing ICFG down.i [2022-04-15 12:30:26,027 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:30:26,027 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:30:26,066 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:30:26,072 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:30:26,072 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:30:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:30:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:30:26,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:26,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:26,095 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 991123303, now seen corresponding path program 1 times [2022-04-15 12:30:26,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:26,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815100074] [2022-04-15 12:30:26,116 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:26,117 INFO L85 PathProgramCache]: Analyzing trace with hash 991123303, now seen corresponding path program 2 times [2022-04-15 12:30:26,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:26,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833953158] [2022-04-15 12:30:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:26,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-15 12:30:26,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:30:26,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-15 12:30:26,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:26,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-15 12:30:26,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:30:26,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-15 12:30:26,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2022-04-15 12:30:26,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~n~0;~k~0 := 0;~i~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {30#(= main_~i~0 0)} is VALID [2022-04-15 12:30:26,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {31#(<= main_~n~0 0)} is VALID [2022-04-15 12:30:26,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(<= main_~n~0 0)} ~j~0 := ~n~0; {32#(<= main_~j~0 0)} is VALID [2022-04-15 12:30:26,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(<= main_~j~0 0)} assume !!(~j~0 > 0); {26#false} is VALID [2022-04-15 12:30:26,336 INFO L272 TraceCheckUtils]: 9: Hoare triple {26#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26#false} is VALID [2022-04-15 12:30:26,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 12:30:26,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 12:30:26,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 12:30:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:26,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833953158] [2022-04-15 12:30:26,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833953158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:26,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:26,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:26,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:26,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [815100074] [2022-04-15 12:30:26,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [815100074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:26,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:26,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:30:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886781763] [2022-04-15 12:30:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-15 12:30:26,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:26,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-04-15 12:30:26,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:26,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:30:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:30:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:30:26,385 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-04-15 12:30:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:26,657 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 12:30:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:30:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-15 12:30:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-04-15 12:30:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 12:30:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-04-15 12:30:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 12:30:26,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-15 12:30:26,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:26,710 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:30:26,710 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:30:26,712 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:30:26,746 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:26,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 39 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:30:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:30:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:30:26,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:26,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:26,783 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:26,783 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:26,785 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 12:30:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:30:26,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:26,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:26,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-15 12:30:26,786 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-15 12:30:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:26,788 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 12:30:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:30:26,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:26,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:26,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:26,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:30:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-15 12:30:26,791 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-15 12:30:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:26,791 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-15 12:30:26,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-04-15 12:30:26,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-15 12:30:26,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:30:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:30:26,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:26,822 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:26,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:30:26,823 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:26,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1458852147, now seen corresponding path program 1 times [2022-04-15 12:30:26,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:26,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2056518430] [2022-04-15 12:30:27,136 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:30:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash -801648754, now seen corresponding path program 1 times [2022-04-15 12:30:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:27,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865350739] [2022-04-15 12:30:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:27,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:27,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {202#true} is VALID [2022-04-15 12:30:27,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-15 12:30:27,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {202#true} {202#true} #64#return; {202#true} is VALID [2022-04-15 12:30:27,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:27,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {202#true} is VALID [2022-04-15 12:30:27,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-15 12:30:27,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #64#return; {202#true} is VALID [2022-04-15 12:30:27,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret6 := main(); {202#true} is VALID [2022-04-15 12:30:27,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} havoc ~n~0;~k~0 := 0;~i~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {207#(= main_~i~0 0)} is VALID [2022-04-15 12:30:27,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#(= main_~i~0 0)} [68] L29-2-->L29-3_primed: Formula: (or (and (< v_main_~i~0_Out_2 (+ v_main_~n~0_In_1 1)) (= (+ (* (- 1) v_main_~k~0_Out_2) v_main_~i~0_Out_2) (+ v_main_~i~0_In_1 (* (- 1) v_main_~k~0_In_1))) (= |v_main_#t~post3_Out_2| 0) (= |v_main_#t~post2_Out_2| 0) (= v_main_~n~0_In_1 0) (<= v_main_~k~0_In_1 v_main_~k~0_Out_2)) (and (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~i~0_In_1 v_main_~i~0_Out_2) (= v_main_~k~0_In_1 v_main_~k~0_Out_2))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~k~0=v_main_~k~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_#t~post2=|v_main_#t~post2_Out_2|, main_#t~post3=|v_main_#t~post3_Out_2|, main_~n~0=v_main_~n~0_In_1, main_~k~0=v_main_~k~0_Out_2} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {208#(or (<= main_~i~0 0) (<= main_~n~0 0))} is VALID [2022-04-15 12:30:27,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(or (<= main_~i~0 0) (<= main_~n~0 0))} [67] L29-3_primed-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {209#(<= main_~n~0 0)} is VALID [2022-04-15 12:30:27,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(<= main_~n~0 0)} ~j~0 := ~n~0; {210#(<= main_~j~0 0)} is VALID [2022-04-15 12:30:27,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(<= main_~j~0 0)} assume !!(~j~0 > 0); {203#false} is VALID [2022-04-15 12:30:27,245 INFO L272 TraceCheckUtils]: 10: Hoare triple {203#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {203#false} is VALID [2022-04-15 12:30:27,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#false} ~cond := #in~cond; {203#false} is VALID [2022-04-15 12:30:27,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#false} assume 0 == ~cond; {203#false} is VALID [2022-04-15 12:30:27,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-15 12:30:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:27,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865350739] [2022-04-15 12:30:27,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865350739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:27,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:27,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:27,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:27,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2056518430] [2022-04-15 12:30:27,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2056518430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:27,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:27,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:30:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972201667] [2022-04-15 12:30:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:27,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 [2022-04-15 12:30:27,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:27,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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) [2022-04-15 12:30:27,309 WARN L143 InductivityCheck]: Transition 212#(and (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) ( _ , assume !(~i~0 < ~n~0); , 209#(<= main_~n~0 0) ) not inductive [2022-04-15 12:30:27,310 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:30:27,310 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:30:27,316 INFO L158 Benchmark]: Toolchain (without parser) took 1844.21ms. Allocated memory is still 183.5MB. Free memory was 136.0MB in the beginning and 132.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.3MB. Max. memory is 8.0GB. [2022-04-15 12:30:27,317 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:30:27,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.74ms. Allocated memory is still 183.5MB. Free memory was 135.8MB in the beginning and 161.9MB in the end (delta: -26.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:30:27,318 INFO L158 Benchmark]: Boogie Preprocessor took 35.09ms. Allocated memory is still 183.5MB. Free memory was 161.9MB in the beginning and 160.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:30:27,320 INFO L158 Benchmark]: RCFGBuilder took 304.29ms. Allocated memory is still 183.5MB. Free memory was 160.0MB in the beginning and 148.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:30:27,320 INFO L158 Benchmark]: TraceAbstraction took 1297.81ms. Allocated memory is still 183.5MB. Free memory was 148.3MB in the beginning and 132.9MB in the end (delta: 15.4MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2022-04-15 12:30:27,323 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.74ms. Allocated memory is still 183.5MB. Free memory was 135.8MB in the beginning and 161.9MB in the end (delta: -26.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.09ms. Allocated memory is still 183.5MB. Free memory was 161.9MB in the beginning and 160.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 304.29ms. Allocated memory is still 183.5MB. Free memory was 160.0MB in the beginning and 148.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1297.81ms. Allocated memory is still 183.5MB. Free memory was 148.3MB in the beginning and 132.9MB in the end (delta: 15.4MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:30:27,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...