/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/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:31:16,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:31:16,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:31:16,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:31:16,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:31:16,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:31:16,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:31:16,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:31:16,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:31:16,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:31:16,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:31:16,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:31:16,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:31:16,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:31:16,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:31:16,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:31:16,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:31:16,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:31:16,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:31:16,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:31:16,573 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:31:16,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:31:16,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:31:16,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:31:16,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:31:16,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:31:16,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:31:16,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:31:16,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:31:16,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:31:16,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:31:16,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:31:16,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:31:16,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:31:16,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:31:16,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:31:16,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:31:16,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:31:16,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:31:16,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:31:16,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:31:16,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:31:16,584 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:31:16,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:31:16,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:31:16,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:31:16,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:31:16,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:31:16,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:31:16,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:31:16,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:31:16,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:31:16,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:31:16,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:31:16,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:31:16,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:31:16,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:31:16,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:31:16,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:31:16,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:31:16,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:31:16,593 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:31:16,593 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:31:16,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:31:16,593 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:31:16,593 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:31:16,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:31:16,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:31:16,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:31:16,800 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:31:16,800 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:31:16,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-15 12:31:16,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b21a813/3ac500d433b8494d8cdb873fc2f4ff25/FLAG407314943 [2022-04-15 12:31:17,162 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:31:17,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-15 12:31:17,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b21a813/3ac500d433b8494d8cdb873fc2f4ff25/FLAG407314943 [2022-04-15 12:31:17,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b21a813/3ac500d433b8494d8cdb873fc2f4ff25 [2022-04-15 12:31:17,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:31:17,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:31:17,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:31:17,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:31:17,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:31:17,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d3cbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17, skipping insertion in model container [2022-04-15 12:31:17,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:31:17,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:31:17,724 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/nested9.i[893,906] [2022-04-15 12:31:17,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:31:17,748 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:31:17,785 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/nested9.i[893,906] [2022-04-15 12:31:17,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:31:17,802 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:31:17,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17 WrapperNode [2022-04-15 12:31:17,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:31:17,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:31:17,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:31:17,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:31:17,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:31:17,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:31:17,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:31:17,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:31:17,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (1/1) ... [2022-04-15 12:31:17,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:31:17,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:31:17,865 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:31:17,880 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:31:17,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:31:17,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:31:17,893 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:31:17,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:31:17,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:31:17,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:31:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:31:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:31:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:31:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:31:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:31:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:31:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:31:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:31:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:31:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:31:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:31:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:31:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:31:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:31:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:31:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:31:17,944 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:31:17,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:31:18,154 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:31:18,158 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:31:18,158 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 12:31:18,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:31:18 BoogieIcfgContainer [2022-04-15 12:31:18,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:31:18,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:31:18,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:31:18,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:31:18,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:31:17" (1/3) ... [2022-04-15 12:31:18,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cf6bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:31:18, skipping insertion in model container [2022-04-15 12:31:18,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:17" (2/3) ... [2022-04-15 12:31:18,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cf6bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:31:18, skipping insertion in model container [2022-04-15 12:31:18,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:31:18" (3/3) ... [2022-04-15 12:31:18,165 INFO L111 eAbstractionObserver]: Analyzing ICFG nested9.i [2022-04-15 12:31:18,169 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:31:18,169 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:31:18,197 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:31:18,201 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:31:18,201 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:31:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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:31:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:31:18,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:18,225 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:18,226 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2111647297, now seen corresponding path program 1 times [2022-04-15 12:31:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:18,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891484913] [2022-04-15 12:31:18,250 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2111647297, now seen corresponding path program 2 times [2022-04-15 12:31:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:18,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47658284] [2022-04-15 12:31:18,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:18,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#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);~__BLAST_NONDET~0 := 0; {32#true} is VALID [2022-04-15 12:31:18,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 12:31:18,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-15 12:31:18,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:18,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#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);~__BLAST_NONDET~0 := 0; {32#true} is VALID [2022-04-15 12:31:18,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 12:31:18,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-15 12:31:18,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2022-04-15 12:31:18,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {32#true} is VALID [2022-04-15 12:31:18,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {32#true} is VALID [2022-04-15 12:31:18,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {32#true} is VALID [2022-04-15 12:31:18,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {32#true} is VALID [2022-04-15 12:31:18,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {32#true} is VALID [2022-04-15 12:31:18,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} ~i~0 := 0; {37#(= main_~i~0 0)} is VALID [2022-04-15 12:31:18,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:31:18,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:31:18,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 < ~j~0); {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:31:18,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {40#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:18,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:18,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-15 12:31:18,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 12:31:18,589 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:31:18,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:18,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47658284] [2022-04-15 12:31:18,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47658284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:18,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:18,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:18,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:18,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891484913] [2022-04-15 12:31:18,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891484913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:18,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:18,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859627445] [2022-04-15 12:31:18,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:18,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-15 12:31:18,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:18,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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:31:18,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:18,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:31:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:18,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:31:18,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:31:18,648 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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:31:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:19,137 INFO L93 Difference]: Finished difference Result 67 states and 98 transitions. [2022-04-15 12:31:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:31:19,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-15 12:31:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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:31:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-15 12:31:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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:31:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-15 12:31:19,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-15 12:31:19,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:19,233 INFO L225 Difference]: With dead ends: 67 [2022-04-15 12:31:19,233 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:31:19,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:31:19,237 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:19,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:31:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:31:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-15 12:31:19,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:19,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:19,268 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:19,268 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:19,271 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 12:31:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 12:31:19,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:19,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:19,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-15 12:31:19,272 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-15 12:31:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:19,274 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 12:31:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 12:31:19,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:19,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:19,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:19,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:31:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-15 12:31:19,278 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2022-04-15 12:31:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:19,278 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-15 12:31:19,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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:31:19,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-15 12:31:19,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-15 12:31:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:31:19,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:19,314 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:19,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:31:19,314 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:19,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash 192634036, now seen corresponding path program 1 times [2022-04-15 12:31:19,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:19,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652113140] [2022-04-15 12:31:19,503 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:31:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash 575356968, now seen corresponding path program 1 times [2022-04-15 12:31:19,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:19,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628412079] [2022-04-15 12:31:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:19,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:19,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#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);~__BLAST_NONDET~0 := 0; {345#true} is VALID [2022-04-15 12:31:19,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-15 12:31:19,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #94#return; {345#true} is VALID [2022-04-15 12:31:19,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {355#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:19,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#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);~__BLAST_NONDET~0 := 0; {345#true} is VALID [2022-04-15 12:31:19,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-15 12:31:19,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #94#return; {345#true} is VALID [2022-04-15 12:31:19,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret7 := main(); {345#true} is VALID [2022-04-15 12:31:19,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {345#true} is VALID [2022-04-15 12:31:19,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {345#true} is VALID [2022-04-15 12:31:19,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {345#true} is VALID [2022-04-15 12:31:19,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {345#true} is VALID [2022-04-15 12:31:19,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {345#true} is VALID [2022-04-15 12:31:19,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {345#true} ~i~0 := 0; {345#true} is VALID [2022-04-15 12:31:19,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {345#true} [98] L34-3-->L35-3_primed: Formula: (or (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)) (let ((.cse0 (* v_main_~i~0_Out_2 2)) (.cse1 (+ 2 v_main_~j~0_Out_2))) (and (<= (* v_main_~i~0_Out_2 3) (+ 3 v_main_~j~0_Out_2)) (= .cse0 0) (< v_main_~i~0_Out_2 (+ v_main_~n~0_In_1 1)) (= .cse0 (* v_main_~i~0_In_1 2)) (= (* v_main_~n~0_In_1 2) 0) (= .cse1 (* 2 |v_main_#t~post4_Out_2|)) (= .cse0 .cse1)))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~i~0=v_main_~i~0_Out_2, main_~n~0=v_main_~n~0_In_1, main_~j~0=v_main_~j~0_Out_2} AuxVars[] AssignedVars[main_~j~0, main_#t~post4, main_~i~0] {345#true} is VALID [2022-04-15 12:31:19,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#true} [97] L35-3_primed-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~j~0=v_main_~j~0_4, main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~j~0] {350#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 12:31:19,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {350#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {351#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-15 12:31:19,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {351#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {352#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-15 12:31:19,607 INFO L272 TraceCheckUtils]: 15: Hoare triple {352#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {353#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:31:19,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {353#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {354#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:31:19,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {346#false} is VALID [2022-04-15 12:31:19,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-04-15 12:31:19,608 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:31:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:19,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628412079] [2022-04-15 12:31:19,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628412079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:19,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:19,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:19,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:19,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652113140] [2022-04-15 12:31:19,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652113140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:19,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:19,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:31:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587293210] [2022-04-15 12:31:19,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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 21 [2022-04-15 12:31:19,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:19,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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:31:19,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:19,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:31:19,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:19,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:31:19,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:31:19,686 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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:31:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:20,359 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-15 12:31:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:31:20,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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 21 [2022-04-15 12:31:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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:31:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2022-04-15 12:31:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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:31:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2022-04-15 12:31:20,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 47 transitions. [2022-04-15 12:31:20,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:20,407 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:31:20,407 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:31:20,408 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:31:20,409 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:20,409 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 46 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:31:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:31:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:31:20,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:20,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-04-15 12:31:20,410 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-04-15 12:31:20,410 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-04-15 12:31:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:20,410 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:31:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:31:20,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:20,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:20,411 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-15 12:31:20,411 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-15 12:31:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:20,411 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:31:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:31:20,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:20,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:20,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:20,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:20,411 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) [2022-04-15 12:31:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:31:20,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-04-15 12:31:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:20,411 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:31:20,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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:31:20,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:31:20,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:31:20,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:20,414 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:31:20,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:31:20,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:31:20,648 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 12:31:20,648 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 12:31:20,648 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 12:31:20,648 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-15 12:31:20,648 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-15 12:31:20,648 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-15 12:31:20,648 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-15 12:31:20,648 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 37) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))) [2022-04-15 12:31:20,648 INFO L878 garLoopResultBuilder]: At program point L35-3(lines 35 37) the Hoare annotation is: (<= (+ main_~i~0 1) main_~n~0) [2022-04-15 12:31:20,648 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-04-15 12:31:20,649 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 25 40) the Hoare annotation is: true [2022-04-15 12:31:20,649 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 37) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))) [2022-04-15 12:31:20,649 INFO L885 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-15 12:31:20,649 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* main_~n~0 2)))) (and (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~k~0 4) .cse0) (<= (+ main_~j~0 3) .cse0))) [2022-04-15 12:31:20,649 INFO L878 garLoopResultBuilder]: At program point L37-1(lines 36 37) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* main_~n~0 2)))) (and (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~k~0 4) .cse0) (<= (+ main_~j~0 3) .cse0))) [2022-04-15 12:31:20,649 INFO L885 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-15 12:31:20,649 INFO L885 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: true [2022-04-15 12:31:20,649 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 25 40) the Hoare annotation is: true [2022-04-15 12:31:20,649 INFO L885 garLoopResultBuilder]: At program point L38(lines 25 40) the Hoare annotation is: true [2022-04-15 12:31:20,649 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 37) the Hoare annotation is: (<= (+ main_~i~0 1) main_~n~0) [2022-04-15 12:31:20,649 INFO L885 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: true [2022-04-15 12:31:20,649 INFO L885 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 25 40) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:31:20,650 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:31:20,650 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 12:31:20,650 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:31:20,650 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:31:20,650 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:31:20,651 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:31:20,653 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 12:31:20,653 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:31:20,656 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:31:20,656 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:31:20,657 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 12:31:20,657 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 12:31:20,657 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 12:31:20,657 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 12:31:20,658 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 12:31:20,665 INFO L163 areAnnotationChecker]: CFG has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:31:20,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:31:20 BoogieIcfgContainer [2022-04-15 12:31:20,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:31:20,672 INFO L158 Benchmark]: Toolchain (without parser) took 3087.68ms. Allocated memory was 182.5MB in the beginning and 263.2MB in the end (delta: 80.7MB). Free memory was 127.3MB in the beginning and 140.9MB in the end (delta: -13.7MB). Peak memory consumption was 67.7MB. Max. memory is 8.0GB. [2022-04-15 12:31:20,672 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 143.2MB in the beginning and 143.1MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:31:20,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.10ms. Allocated memory was 182.5MB in the beginning and 263.2MB in the end (delta: 80.7MB). Free memory was 127.1MB in the beginning and 235.6MB in the end (delta: -108.5MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-04-15 12:31:20,673 INFO L158 Benchmark]: Boogie Preprocessor took 24.20ms. Allocated memory is still 263.2MB. Free memory was 235.6MB in the beginning and 234.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:31:20,673 INFO L158 Benchmark]: RCFGBuilder took 331.97ms. Allocated memory is still 263.2MB. Free memory was 233.5MB in the beginning and 219.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 12:31:20,673 INFO L158 Benchmark]: TraceAbstraction took 2510.08ms. Allocated memory is still 263.2MB. Free memory was 218.8MB in the beginning and 140.9MB in the end (delta: 77.8MB). Peak memory consumption was 78.4MB. Max. memory is 8.0GB. [2022-04-15 12:31:20,674 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.12ms. Allocated memory is still 182.5MB. Free memory was 143.2MB in the beginning and 143.1MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.10ms. Allocated memory was 182.5MB in the beginning and 263.2MB in the end (delta: 80.7MB). Free memory was 127.1MB in the beginning and 235.6MB in the end (delta: -108.5MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.20ms. Allocated memory is still 263.2MB. Free memory was 235.6MB in the beginning and 234.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 331.97ms. Allocated memory is still 263.2MB. Free memory was 233.5MB in the beginning and 219.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2510.08ms. Allocated memory is still 263.2MB. Free memory was 218.8MB in the beginning and 140.9MB in the end (delta: 77.8MB). Peak memory consumption was 78.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 41 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=1, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 65 PreInvPairs, 124 NumberOfFragments, 145 HoareAnnotationTreeSize, 65 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 799 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: i + 1 <= n - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: i + 1 <= n && j + 3 <= i + n * 2 - ProcedureContractResult [Line: 25]: 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! [2022-04-15 12:31:20,699 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...