/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-zilu/benchmark34_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:11:02,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:11:02,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:11:02,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:11:02,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:11:02,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:11:02,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:11:02,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:11:02,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:11:02,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:11:02,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:11:02,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:11:02,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:11:02,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:11:02,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:11:02,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:11:02,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:11:02,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:11:02,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:11:02,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:11:02,275 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:11:02,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:11:02,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:11:02,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:11:02,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:11:02,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:11:02,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:11:02,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:11:02,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:11:02,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:11:02,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:11:02,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:11:02,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:11:02,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:11:02,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:11:02,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:11:02,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:11:02,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:11:02,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:11:02,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:11:02,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:11:02,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:11:02,289 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 07:11:02,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:11:02,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:11:02,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:11:02,296 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:11:02,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:11:02,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:11:02,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:11:02,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:11:02,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:11:02,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:11:02,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:11:02,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:11:02,298 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:11:02,299 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:11:02,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:11:02,299 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:11:02,299 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 07:11:02,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:11:02,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:11:02,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:11:02,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:11:02,477 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:11:02,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark34_conjunctive.i [2022-04-15 07:11:02,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a7ec87f/5a26d053eca04a7cbdaad5adec82753d/FLAG909235382 [2022-04-15 07:11:02,880 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:11:02,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark34_conjunctive.i [2022-04-15 07:11:02,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a7ec87f/5a26d053eca04a7cbdaad5adec82753d/FLAG909235382 [2022-04-15 07:11:02,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a7ec87f/5a26d053eca04a7cbdaad5adec82753d [2022-04-15 07:11:02,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:11:02,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:11:02,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:11:02,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:11:02,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:11:02,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:11:02" (1/1) ... [2022-04-15 07:11:02,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a84e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:02, skipping insertion in model container [2022-04-15 07:11:02,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:11:02" (1/1) ... [2022-04-15 07:11:02,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:11:02,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:11:03,092 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-zilu/benchmark34_conjunctive.i[873,886] [2022-04-15 07:11:03,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:11:03,103 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:11:03,112 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-zilu/benchmark34_conjunctive.i[873,886] [2022-04-15 07:11:03,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:11:03,124 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:11:03,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03 WrapperNode [2022-04-15 07:11:03,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:11:03,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:11:03,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:11:03,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:11:03,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (1/1) ... [2022-04-15 07:11:03,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (1/1) ... [2022-04-15 07:11:03,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (1/1) ... [2022-04-15 07:11:03,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (1/1) ... [2022-04-15 07:11:03,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (1/1) ... [2022-04-15 07:11:03,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (1/1) ... [2022-04-15 07:11:03,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (1/1) ... [2022-04-15 07:11:03,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:11:03,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:11:03,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:11:03,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:11:03,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (1/1) ... [2022-04-15 07:11:03,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:11:03,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:11:03,171 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 07:11:03,179 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 07:11:03,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:11:03,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:11:03,199 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:11:03,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:11:03,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:11:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:11:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 07:11:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 07:11:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:11:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:11:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:11:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 07:11:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:11:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:11:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:11:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:11:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:11:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:11:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:11:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:11:03,273 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:11:03,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:11:03,423 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:11:03,428 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:11:03,428 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:11:03,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:11:03 BoogieIcfgContainer [2022-04-15 07:11:03,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:11:03,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:11:03,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:11:03,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:11:03,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:11:02" (1/3) ... [2022-04-15 07:11:03,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be2226a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:11:03, skipping insertion in model container [2022-04-15 07:11:03,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:03" (2/3) ... [2022-04-15 07:11:03,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be2226a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:11:03, skipping insertion in model container [2022-04-15 07:11:03,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:11:03" (3/3) ... [2022-04-15 07:11:03,437 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark34_conjunctive.i [2022-04-15 07:11:03,440 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:11:03,440 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:11:03,476 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:11:03,484 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 07:11:03,484 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:11:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 07:11:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:11:03,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:03,513 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:03,514 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:03,518 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-15 07:11:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:03,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1533969948] [2022-04-15 07:11:03,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:11:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-15 07:11:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:03,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589741986] [2022-04-15 07:11:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:03,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:03,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-15 07:11:03,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:11:03,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 07:11:03,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:03,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-15 07:11:03,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:11:03,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 07:11:03,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-15 07:11:03,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-15 07:11:03,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {28#(and (not (<= main_~n~0 0)) (= main_~j~0 0))} is VALID [2022-04-15 07:11:03,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (not (<= main_~n~0 0)) (= main_~j~0 0))} assume !(~j~0 < ~n~0 && ~n~0 > 0); {24#false} is VALID [2022-04-15 07:11:03,738 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {24#false} is VALID [2022-04-15 07:11:03,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 07:11:03,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 07:11:03,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 07:11:03,739 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 07:11:03,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:03,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589741986] [2022-04-15 07:11:03,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589741986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:03,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:03,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:03,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:03,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1533969948] [2022-04-15 07:11:03,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1533969948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:03,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:03,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829723254] [2022-04-15 07:11:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 07:11:03,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:03,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 07:11:03,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:03,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:11:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:03,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:11:03,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:11:03,794 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 07:11:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:03,907 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 07:11:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:11:03,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 07:11:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 07:11:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-15 07:11:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 07:11:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-15 07:11:03,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-15 07:11:03,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:03,966 INFO L225 Difference]: With dead ends: 33 [2022-04-15 07:11:03,966 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 07:11:03,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:11:03,971 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:03,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:11:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 07:11:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 07:11:03,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:04,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 07:11:04,000 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 07:11:04,000 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 07:11:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:04,003 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:11:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:11:04,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:04,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:04,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-15 07:11:04,005 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-15 07:11:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:04,007 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:11:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:11:04,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:04,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:04,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:04,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 07:11:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 07:11:04,010 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 07:11:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:04,011 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 07:11:04,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 07:11:04,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 07:11:04,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:11:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 07:11:04,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:04,034 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:04,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:11:04,035 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-15 07:11:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:04,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471998345] [2022-04-15 07:11:04,330 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:04,332 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:04,335 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-15 07:11:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:04,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582386389] [2022-04-15 07:11:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:04,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {156#true} is VALID [2022-04-15 07:11:04,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 07:11:04,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 07:11:04,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:04,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {156#true} is VALID [2022-04-15 07:11:04,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 07:11:04,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 07:11:04,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret6 := main(); {156#true} is VALID [2022-04-15 07:11:04,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {156#true} is VALID [2022-04-15 07:11:04,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {161#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-15 07:11:04,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} [49] L24-2-->L24-3_primed: Formula: (let ((.cse0 (< 0 v_main_~n~0_6)) (.cse2 (= v_main_~j~0_8 v_main_~j~0_7)) (.cse3 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse4 (= v_main_~k~0_9 v_main_~k~0_8)) (.cse5 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (let ((.cse1 (+ v_main_~j~0_8 v_main_~k~0_9))) (and .cse0 (< v_main_~k~0_8 v_main_~k~0_9) (< .cse1 (+ v_main_~k~0_8 v_main_~n~0_6 1)) (= .cse1 (+ v_main_~j~0_7 v_main_~k~0_8)))) (and (or (not (< v_main_~j~0_8 v_main_~n~0_6)) (not .cse0)) .cse2 .cse3 .cse4 .cse5) (and (= v_main_~n~0_6 v_main_~n~0_6) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_#t~post5=|v_main_#t~post5_4|, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_9, main_~j~0=v_main_~j~0_8} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_3|, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_8, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {162#(and (not (<= main_~n~0 0)) (or (and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0))) (<= main_~j~0 0)))} is VALID [2022-04-15 07:11:04,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#(and (not (<= main_~n~0 0)) (or (and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0))) (<= main_~j~0 0)))} [48] L24-3_primed-->L24-3: Formula: (or (not (< v_main_~j~0_1 v_main_~n~0_1)) (not (< 0 v_main_~n~0_1))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {163#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-15 07:11:04,465 INFO L272 TraceCheckUtils]: 9: Hoare triple {163#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:11:04,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {165#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:11:04,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {165#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {157#false} is VALID [2022-04-15 07:11:04,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 07:11:04,466 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 07:11:04,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:04,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582386389] [2022-04-15 07:11:04,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582386389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:04,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:04,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:11:04,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:04,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471998345] [2022-04-15 07:11:04,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471998345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:04,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:04,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:11:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697739503] [2022-04-15 07:11:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 07:11:04,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:04,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:04,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:04,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:11:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:04,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:11:04,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:11:04,614 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:04,706 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:11:04,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:11:04,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 07:11:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-15 07:11:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-15 07:11:04,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2022-04-15 07:11:04,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:04,722 INFO L225 Difference]: With dead ends: 14 [2022-04-15 07:11:04,722 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:11:04,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:11:04,723 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:04,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-04-15 07:11:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:11:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:11:04,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:04,724 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 07:11:04,724 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 07:11:04,724 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 07:11:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:04,725 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:11:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:04,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:04,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:04,725 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 07:11:04,725 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 07:11:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:04,725 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:11:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:04,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:04,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:04,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:04,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:04,726 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 07:11:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:11:04,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 07:11:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:04,726 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:11:04,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:04,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:11:04,726 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 07:11:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:04,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:04,728 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:11:04,728 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:11:04,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:11:04,784 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-15 07:11:04,784 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-15 07:11:04,784 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-15 07:11:04,784 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 29) the Hoare annotation is: true [2022-04-15 07:11:04,784 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-15 07:11:04,784 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 29) the Hoare annotation is: true [2022-04-15 07:11:04,784 INFO L885 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-15 07:11:04,784 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 26) the Hoare annotation is: (and (not (<= main_~n~0 0)) (exists ((v_main_~k~0_13 Int)) (and (<= v_main_~k~0_13 main_~n~0) (or (and (= v_main_~k~0_13 (+ main_~k~0 main_~j~0)) (< v_main_~k~0_13 (+ main_~n~0 main_~k~0 1)) (< main_~k~0 v_main_~k~0_13)) (and (= v_main_~k~0_13 main_~k~0) (= main_~j~0 0))) (<= main_~n~0 v_main_~k~0_13)))) [2022-04-15 07:11:04,785 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)) [2022-04-15 07:11:04,785 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 29) the Hoare annotation is: true [2022-04-15 07:11:04,785 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:11:04,785 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:11:04,785 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:11:04,785 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:11:04,785 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 07:11:04,785 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:11:04,785 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:11:04,785 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:11:04,785 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:11:04,786 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 07:11:04,786 INFO L885 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-15 07:11:04,786 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-15 07:11:04,786 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:11:04,788 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 07:11:04,788 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:11:04,791 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:11:04,791 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:11:04,792 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-15 07:11:04,800 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 07:11:04,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:11:04 BoogieIcfgContainer [2022-04-15 07:11:04,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:11:04,808 INFO L158 Benchmark]: Toolchain (without parser) took 1889.87ms. Allocated memory was 189.8MB in the beginning and 242.2MB in the end (delta: 52.4MB). Free memory was 132.9MB in the beginning and 154.7MB in the end (delta: -21.8MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-04-15 07:11:04,808 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:11:04,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.82ms. Allocated memory was 189.8MB in the beginning and 242.2MB in the end (delta: 52.4MB). Free memory was 132.8MB in the beginning and 211.9MB in the end (delta: -79.1MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-04-15 07:11:04,809 INFO L158 Benchmark]: Boogie Preprocessor took 25.64ms. Allocated memory is still 242.2MB. Free memory was 211.9MB in the beginning and 210.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:11:04,809 INFO L158 Benchmark]: RCFGBuilder took 277.78ms. Allocated memory is still 242.2MB. Free memory was 210.4MB in the beginning and 198.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:11:04,809 INFO L158 Benchmark]: TraceAbstraction took 1376.94ms. Allocated memory is still 242.2MB. Free memory was 198.7MB in the beginning and 154.7MB in the end (delta: 44.0MB). Peak memory consumption was 45.0MB. Max. memory is 8.0GB. [2022-04-15 07:11:04,811 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.09ms. Allocated memory is still 189.8MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.82ms. Allocated memory was 189.8MB in the beginning and 242.2MB in the end (delta: 52.4MB). Free memory was 132.8MB in the beginning and 211.9MB in the end (delta: -79.1MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.64ms. Allocated memory is still 242.2MB. Free memory was 211.9MB in the beginning and 210.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 277.78ms. Allocated memory is still 242.2MB. Free memory was 210.4MB in the beginning and 198.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1376.94ms. Allocated memory is still 242.2MB. Free memory was 198.7MB in the beginning and 154.7MB in the end (delta: 44.0MB). Peak memory consumption was 45.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] * 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: 16]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 27 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 26 PreInvPairs, 35 NumberOfFragments, 80 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 50 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 24]: Loop Invariant [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] [2022-04-15 07:11:04,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_13,QUANTIFIED] Derived loop invariant: !(n <= 0) && (\exists v_main_~k~0_13 : int :: (v_main_~k~0_13 <= n && (((v_main_~k~0_13 == k + j && v_main_~k~0_13 < n + k + 1) && k < v_main_~k~0_13) || (v_main_~k~0_13 == k && j == 0))) && n <= v_main_~k~0_13) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 07:11:04,837 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...