/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:12:15,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:12:15,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:12:15,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:12:15,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:12:15,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:12:15,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:12:15,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:12:15,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:12:15,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:12:15,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:12:15,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:12:15,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:12:15,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:12:15,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:12:15,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:12:15,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:12:15,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:12:15,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:12:15,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:12:15,238 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:12:15,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:12:15,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:12:15,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:12:15,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:12:15,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:12:15,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:12:15,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:12:15,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:12:15,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:12:15,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:12:15,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:12:15,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:12:15,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:12:15,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:12:15,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:12:15,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:12:15,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:12:15,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:12:15,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:12:15,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:12:15,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:12:15,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:12:15,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:12:15,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:12:15,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:12:15,285 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:12:15,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:12:15,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:12:15,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:12:15,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:12:15,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:12:15,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:12:15,286 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:12:15,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:12:15,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:12:15,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:12:15,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:12:15,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:12:15,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:12:15,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:12:15,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:15,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:12:15,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:12:15,288 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:12:15,288 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:12:15,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:12:15,288 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:12:15,289 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 06:12:15,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:12:15,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:12:15,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:12:15,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:12:15,491 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:12:15,492 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 06:12:15,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebf62dc7/dc2631e476384749aad6eae0f9344053/FLAG5f6c1b9a7 [2022-04-15 06:12:15,942 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:12:15,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-15 06:12:15,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebf62dc7/dc2631e476384749aad6eae0f9344053/FLAG5f6c1b9a7 [2022-04-15 06:12:15,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebf62dc7/dc2631e476384749aad6eae0f9344053 [2022-04-15 06:12:15,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:12:15,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:12:15,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:15,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:12:15,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:12:15,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:15" (1/1) ... [2022-04-15 06:12:15,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a872b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:15, skipping insertion in model container [2022-04-15 06:12:15,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:15" (1/1) ... [2022-04-15 06:12:15,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:12:15,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:12:16,122 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 06:12:16,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:16,148 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:12:16,156 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 06:12:16,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:16,179 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:12:16,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16 WrapperNode [2022-04-15 06:12:16,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:16,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:12:16,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:12:16,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:12:16,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (1/1) ... [2022-04-15 06:12:16,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (1/1) ... [2022-04-15 06:12:16,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (1/1) ... [2022-04-15 06:12:16,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (1/1) ... [2022-04-15 06:12:16,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (1/1) ... [2022-04-15 06:12:16,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (1/1) ... [2022-04-15 06:12:16,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (1/1) ... [2022-04-15 06:12:16,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:12:16,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:12:16,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:12:16,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:12:16,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (1/1) ... [2022-04-15 06:12:16,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:16,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:16,224 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 06:12:16,228 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 06:12:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:12:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:12:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:12:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:12:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:12:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:12:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:12:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:12:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:12:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:12:16,307 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:12:16,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:12:16,458 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:12:16,462 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:12:16,462 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 06:12:16,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:16 BoogieIcfgContainer [2022-04-15 06:12:16,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:12:16,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:12:16,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:12:16,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:12:16,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:12:15" (1/3) ... [2022-04-15 06:12:16,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29930f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:16, skipping insertion in model container [2022-04-15 06:12:16,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:16" (2/3) ... [2022-04-15 06:12:16,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29930f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:16, skipping insertion in model container [2022-04-15 06:12:16,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:16" (3/3) ... [2022-04-15 06:12:16,479 INFO L111 eAbstractionObserver]: Analyzing ICFG nested9.i [2022-04-15 06:12:16,482 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:12:16,482 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:12:16,508 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:12:16,513 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 06:12:16,513 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:12:16,525 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 06:12:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:12:16,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:16,530 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 06:12:16,530 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:16,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2111647297, now seen corresponding path program 1 times [2022-04-15 06:12:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:16,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [652682029] [2022-04-15 06:12:16,550 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2111647297, now seen corresponding path program 2 times [2022-04-15 06:12:16,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:16,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559967147] [2022-04-15 06:12:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:16,840 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 06:12:16,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 06:12:16,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-15 06:12:16,842 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 06:12:16,842 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 06:12:16,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 06:12:16,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-15 06:12:16,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2022-04-15 06:12:16,843 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 06:12:16,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {32#true} is VALID [2022-04-15 06:12:16,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {32#true} is VALID [2022-04-15 06:12:16,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {32#true} is VALID [2022-04-15 06:12:16,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {32#true} is VALID [2022-04-15 06:12:16,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} ~i~0 := 0; {37#(= main_~i~0 0)} is VALID [2022-04-15 06:12:16,846 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 06:12:16,847 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 06:12:16,848 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 06:12:16,849 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 06:12:16,850 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 06:12:16,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-15 06:12:16,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 06:12:16,851 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 06:12:16,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:16,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559967147] [2022-04-15 06:12:16,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559967147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:16,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:16,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:16,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:16,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [652682029] [2022-04-15 06:12:16,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [652682029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:16,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:16,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:16,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180623810] [2022-04-15 06:12:16,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:16,868 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 06:12:16,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:16,872 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 06:12:16,895 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 06:12:16,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:12:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:16,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:12:16,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:16,930 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 06:12:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:17,432 INFO L93 Difference]: Finished difference Result 67 states and 98 transitions. [2022-04-15 06:12:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:12:17,433 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 06:12:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:17,434 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 06:12:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-15 06:12:17,442 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 06:12:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-15 06:12:17,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-15 06:12:17,557 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 06:12:17,567 INFO L225 Difference]: With dead ends: 67 [2022-04-15 06:12:17,567 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:12:17,569 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 06:12:17,571 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 06:12:17,572 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 06:12:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:12:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-15 06:12:17,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:17,599 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 06:12:17,600 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 06:12:17,600 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 06:12:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:17,604 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 06:12:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 06:12:17,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:17,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:17,605 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 06:12:17,605 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 06:12:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:17,607 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 06:12:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 06:12:17,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:17,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:17,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:17,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:17,608 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 06:12:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-15 06:12:17,611 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2022-04-15 06:12:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:17,611 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-15 06:12:17,612 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 06:12:17,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-15 06:12:17,648 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 06:12:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-15 06:12:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:12:17,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:17,649 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 06:12:17,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:12:17,649 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash 192634036, now seen corresponding path program 1 times [2022-04-15 06:12:17,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:17,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [456270530] [2022-04-15 06:12:18,939 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:12:19,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:12:19,165 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:12:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash 575356968, now seen corresponding path program 1 times [2022-04-15 06:12:19,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:19,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247232896] [2022-04-15 06:12:19,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:19,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:19,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:19,315 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 06:12:19,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-15 06:12:19,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #94#return; {345#true} is VALID [2022-04-15 06:12:19,317 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 06:12:19,317 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 06:12:19,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-15 06:12:19,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #94#return; {345#true} is VALID [2022-04-15 06:12:19,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret7 := main(); {345#true} is VALID [2022-04-15 06:12:19,318 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 06:12:19,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {345#true} is VALID [2022-04-15 06:12:19,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {345#true} is VALID [2022-04-15 06:12:19,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {345#true} is VALID [2022-04-15 06:12:19,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {345#true} is VALID [2022-04-15 06:12:19,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {345#true} ~i~0 := 0; {345#true} is VALID [2022-04-15 06:12:19,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {345#true} [98] L34-3-->L35-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_12 v_main_~i~0_11)) (.cse1 (= v_main_~j~0_10 v_main_~j~0_9)) (.cse2 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and .cse0 (= v_main_~n~0_12 v_main_~n~0_12) .cse1 .cse2) (and (or (not (< v_main_~i~0_12 v_main_~n~0_12)) (not (<= v_main_~i~0_12 0))) .cse0 .cse1 .cse2) (and (< v_main_~i~0_11 (+ v_main_~n~0_12 1)) (= (+ v_main_~j~0_9 2) (* v_main_~i~0_11 2)) (<= v_main_~i~0_11 1) (< v_main_~i~0_12 v_main_~i~0_11)))) InVars {main_~i~0=v_main_~i~0_12, main_#t~post4=|v_main_#t~post4_4|, main_~n~0=v_main_~n~0_12, main_~j~0=v_main_~j~0_10} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_12, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~j~0, main_#t~post4, main_~i~0] {345#true} is VALID [2022-04-15 06:12:19,320 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 06:12:19,321 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 06:12:19,322 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 06:12:19,324 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 06:12:19,325 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 06:12:19,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {346#false} is VALID [2022-04-15 06:12:19,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-04-15 06:12:19,326 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 06:12:19,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:19,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247232896] [2022-04-15 06:12:19,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247232896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:19,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:19,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:19,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [456270530] [2022-04-15 06:12:19,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [456270530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:19,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:19,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:12:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157465859] [2022-04-15 06:12:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:19,414 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 06:12:19,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:19,427 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 06:12:19,447 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 06:12:19,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:12:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:19,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:12:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:12:19,450 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 06:12:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:20,112 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-15 06:12:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:12:20,113 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 06:12:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:20,113 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 06:12:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2022-04-15 06:12:20,115 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 06:12:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2022-04-15 06:12:20,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 47 transitions. [2022-04-15 06:12:20,175 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 06:12:20,176 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:12:20,176 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:12:20,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:12:20,177 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 06:12:20,178 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 06:12:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:12:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:12:20,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:20,179 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 06:12:20,179 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 06:12:20,179 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 06:12:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:20,180 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:12:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:12:20,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:20,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:20,180 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 06:12:20,180 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 06:12:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:20,180 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:12:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:12:20,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:20,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:20,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:20,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:20,181 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 06:12:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:12:20,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-04-15 06:12:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:20,181 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:12:20,181 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 06:12:20,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:12:20,181 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 06:12:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:12:20,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:20,183 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:12:20,184 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:12:20,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:12:20,480 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 06:12:20,480 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 06:12:20,480 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 06:12:20,480 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-15 06:12:20,481 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:12:20,481 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:12:20,481 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:12:20,481 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 06:12:20,481 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 06:12:20,481 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-04-15 06:12:20,481 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 25 40) the Hoare annotation is: true [2022-04-15 06:12:20,481 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 06:12:20,481 INFO L885 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-15 06:12:20,481 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 06:12:20,482 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 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-15 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: true [2022-04-15 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 25 40) the Hoare annotation is: true [2022-04-15 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point L38(lines 25 40) the Hoare annotation is: true [2022-04-15 06:12:20,482 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 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: true [2022-04-15 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-04-15 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 25 40) the Hoare annotation is: true [2022-04-15 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:12:20,482 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 06:12:20,482 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:12:20,483 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:12:20,483 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:12:20,483 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:12:20,483 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:12:20,483 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 06:12:20,483 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 06:12:20,483 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 06:12:20,483 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 06:12:20,483 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 06:12:20,483 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 06:12:20,485 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 06:12:20,486 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:12:20,496 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:12:20,496 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:12:20,497 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 06:12:20,498 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 06:12:20,498 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:12:20,498 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:12:20,498 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 06:12:20,505 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 06:12:20,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:12:20 BoogieIcfgContainer [2022-04-15 06:12:20,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:12:20,523 INFO L158 Benchmark]: Toolchain (without parser) took 4563.21ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 154.4MB in the beginning and 236.4MB in the end (delta: -82.0MB). Peak memory consumption was 129.8MB. Max. memory is 8.0GB. [2022-04-15 06:12:20,523 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:12:20,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.97ms. Allocated memory is still 203.4MB. Free memory was 154.2MB in the beginning and 178.6MB in the end (delta: -24.4MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-15 06:12:20,525 INFO L158 Benchmark]: Boogie Preprocessor took 19.25ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 177.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 06:12:20,525 INFO L158 Benchmark]: RCFGBuilder took 264.17ms. Allocated memory is still 203.4MB. Free memory was 177.1MB in the beginning and 163.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 06:12:20,526 INFO L158 Benchmark]: TraceAbstraction took 4056.38ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 162.9MB in the beginning and 236.4MB in the end (delta: -73.5MB). Peak memory consumption was 137.8MB. Max. memory is 8.0GB. [2022-04-15 06:12:20,527 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 203.4MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.97ms. Allocated memory is still 203.4MB. Free memory was 154.2MB in the beginning and 178.6MB in the end (delta: -24.4MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.25ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 177.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 264.17ms. Allocated memory is still 203.4MB. Free memory was 177.1MB in the beginning and 163.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4056.38ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 162.9MB in the beginning and 236.4MB in the end (delta: -73.5MB). Peak memory consumption was 137.8MB. 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: 4.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.4s 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.4s 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.2s 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 06:12:20,561 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...