/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/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:43:57,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:43:57,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:43:57,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:43:57,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:43:57,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:43:57,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:43:57,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:43:57,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:43:57,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:43:57,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:43:57,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:43:57,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:43:57,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:43:57,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:43:57,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:43:57,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:43:57,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:43:57,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:43:57,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:43:57,173 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:43:57,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:43:57,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:43:57,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:43:57,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:43:57,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:43:57,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:43:57,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:43:57,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:43:57,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:43:57,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:43:57,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:43:57,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:43:57,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:43:57,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:43:57,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:43:57,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:43:57,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:43:57,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:43:57,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:43:57,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:43:57,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:43:57,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:43:57,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:43:57,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:43:57,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:43:57,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:43:57,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:43:57,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:43:57,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:43:57,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:43:57,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:43:57,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:43:57,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:43:57,210 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:43:57,210 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:43:57,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:43:57,210 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:43:57,210 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-28 02:43:57,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:43:57,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:43:57,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:43:57,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:43:57,355 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:43:57,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2022-04-28 02:43:57,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc15123b/6fd83c79f05e470f958a5128f9c60237/FLAG40933d4f7 [2022-04-28 02:43:57,821 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:43:57,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2022-04-28 02:43:57,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc15123b/6fd83c79f05e470f958a5128f9c60237/FLAG40933d4f7 [2022-04-28 02:43:57,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc15123b/6fd83c79f05e470f958a5128f9c60237 [2022-04-28 02:43:57,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:43:57,848 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:43:57,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:43:57,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:43:57,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:43:57,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:43:57" (1/1) ... [2022-04-28 02:43:57,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c5f078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:57, skipping insertion in model container [2022-04-28 02:43:57,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:43:57" (1/1) ... [2022-04-28 02:43:57,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:43:57,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:43:58,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i[808,821] [2022-04-28 02:43:58,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:43:58,047 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:43:58,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i[808,821] [2022-04-28 02:43:58,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:43:58,064 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:43:58,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58 WrapperNode [2022-04-28 02:43:58,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:43:58,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:43:58,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:43:58,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:43:58,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (1/1) ... [2022-04-28 02:43:58,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (1/1) ... [2022-04-28 02:43:58,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (1/1) ... [2022-04-28 02:43:58,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (1/1) ... [2022-04-28 02:43:58,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (1/1) ... [2022-04-28 02:43:58,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (1/1) ... [2022-04-28 02:43:58,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (1/1) ... [2022-04-28 02:43:58,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:43:58,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:43:58,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:43:58,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:43:58,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (1/1) ... [2022-04-28 02:43:58,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:43:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:43:58,118 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-28 02:43:58,127 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-28 02:43:58,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:43:58,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:43:58,180 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:43:58,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:43:58,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:43:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:43:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:43:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 02:43:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:43:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:43:58,221 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:43:58,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:43:58,332 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:43:58,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:43:58,336 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:43:58,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:43:58 BoogieIcfgContainer [2022-04-28 02:43:58,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:43:58,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:43:58,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:43:58,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:43:58,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:43:57" (1/3) ... [2022-04-28 02:43:58,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d80912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:43:58, skipping insertion in model container [2022-04-28 02:43:58,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:43:58" (2/3) ... [2022-04-28 02:43:58,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d80912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:43:58, skipping insertion in model container [2022-04-28 02:43:58,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:43:58" (3/3) ... [2022-04-28 02:43:58,348 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2022-04-28 02:43:58,375 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:43:58,375 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:43:58,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:43:58,406 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@219ada77, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25800a97 [2022-04-28 02:43:58,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:43:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-28 02:43:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:43:58,417 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:58,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:58,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873075, now seen corresponding path program 1 times [2022-04-28 02:43:58,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:58,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922220305] [2022-04-28 02:43:58,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:43:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873075, now seen corresponding path program 2 times [2022-04-28 02:43:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:58,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132468733] [2022-04-28 02:43:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:58,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(10, 2); {22#true} is VALID [2022-04-28 02:43:58,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 02:43:58,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-28 02:43:58,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:58,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(10, 2); {22#true} is VALID [2022-04-28 02:43:58,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 02:43:58,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-28 02:43:58,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2022-04-28 02:43:58,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2022-04-28 02:43:58,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-28 02:43:58,539 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2022-04-28 02:43:58,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 02:43:58,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 02:43:58,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 02:43:58,540 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-28 02:43:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132468733] [2022-04-28 02:43:58,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132468733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:58,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:58,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:43:58,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922220305] [2022-04-28 02:43:58,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922220305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:58,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:58,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:43:58,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795658328] [2022-04-28 02:43:58,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:58,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-28 02:43:58,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:58,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:43:58,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:58,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:43:58,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:58,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:43:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:43:58,581 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:43:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:58,650 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 02:43:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:43:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-28 02:43:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:43:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-28 02:43:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:43:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-28 02:43:58,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-28 02:43:58,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:58,711 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:43:58,711 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 02:43:58,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:43:58,718 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:58,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:43:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 02:43:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 02:43:58,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:58,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 02:43:58,742 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 02:43:58,742 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 02:43:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:58,745 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 02:43:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:43:58,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:58,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:58,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 02:43:58,746 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 02:43:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:58,748 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 02:43:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:43:58,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:58,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:58,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:58,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 02:43:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 02:43:58,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 02:43:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:58,750 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 02:43:58,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:43:58,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 02:43:58,768 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-28 02:43:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:43:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:43:58,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:58,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:58,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:43:58,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1280414201, now seen corresponding path program 1 times [2022-04-28 02:43:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:58,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758184441] [2022-04-28 02:43:58,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:43:58,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1280414201, now seen corresponding path program 2 times [2022-04-28 02:43:58,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:58,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062138797] [2022-04-28 02:43:58,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:58,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:58,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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(10, 2); {142#true} is VALID [2022-04-28 02:43:58,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 02:43:58,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-28 02:43:58,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:58,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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(10, 2); {142#true} is VALID [2022-04-28 02:43:58,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 02:43:58,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-28 02:43:58,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret2 := main(); {142#true} is VALID [2022-04-28 02:43:58,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {147#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 02:43:58,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 <= 8); {143#false} is VALID [2022-04-28 02:43:58,848 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {143#false} is VALID [2022-04-28 02:43:58,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-28 02:43:58,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-28 02:43:58,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-28 02:43:58,848 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-28 02:43:58,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:58,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062138797] [2022-04-28 02:43:58,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062138797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:58,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:58,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:43:58,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:58,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758184441] [2022-04-28 02:43:58,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758184441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:58,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:58,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:43:58,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739802603] [2022-04-28 02:43:58,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:58,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-28 02:43:58,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:58,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:43:58,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:58,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:43:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:43:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:43:58,862 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:43:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:58,916 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:43:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:43:58,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-28 02:43:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:43:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-28 02:43:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:43:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-28 02:43:58,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-28 02:43:58,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:58,943 INFO L225 Difference]: With dead ends: 20 [2022-04-28 02:43:58,943 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:43:58,944 INFO L412 NwaCegarLoop]: 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-28 02:43:58,946 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:58,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:43:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:43:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-28 02:43:58,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:58,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 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-28 02:43:58,956 INFO L74 IsIncluded]: Start isIncluded. First operand 15 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-28 02:43:58,956 INFO L87 Difference]: Start difference. First operand 15 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-28 02:43:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:58,960 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:43:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:43:58,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:58,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:58,961 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 15 states. [2022-04-28 02:43:58,961 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 15 states. [2022-04-28 02:43:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:58,962 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:43:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:43:58,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:58,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:58,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:58,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:58,962 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-28 02:43:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 02:43:58,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-28 02:43:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:58,963 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 02:43:58,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:43:58,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 02:43:58,978 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-28 02:43:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 02:43:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 02:43:58,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:58,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:58,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:43:58,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash -985852763, now seen corresponding path program 1 times [2022-04-28 02:43:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:58,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [45026357] [2022-04-28 02:44:00,148 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:44:00,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:44:00,238 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:44:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash -87506669, now seen corresponding path program 1 times [2022-04-28 02:44:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:44:00,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549538456] [2022-04-28 02:44:00,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:44:00,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:44:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:44:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:00,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#(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(10, 2); {251#true} is VALID [2022-04-28 02:44:00,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 02:44:00,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 02:44:00,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:44:00,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#(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(10, 2); {251#true} is VALID [2022-04-28 02:44:00,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 02:44:00,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 02:44:00,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret2 := main(); {251#true} is VALID [2022-04-28 02:44:00,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {256#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:44:00,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [46] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_7 v_main_~sn~0_6)) (.cse1 (= v_main_~i~0_9 v_main_~i~0_8)) (.cse2 (= |v_main_#t~post1_4| |v_main_#t~post1_3|))) (or (and (<= v_main_~i~0_8 9) (< v_main_~i~0_9 v_main_~i~0_8) (= (+ v_main_~sn~0_7 (* v_main_~i~0_8 2)) (+ v_main_~sn~0_6 (* v_main_~i~0_9 2)))) (and .cse0 .cse1 .cse2) (and .cse0 (not (<= v_main_~i~0_9 8)) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_9, main_~sn~0=v_main_~sn~0_7, main_#t~post1=|v_main_#t~post1_4|} OutVars{main_~i~0=v_main_~i~0_8, main_~sn~0=v_main_~sn~0_6, main_#t~post1=|v_main_#t~post1_3|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {257#(or (<= main_~i~0 1) (and (<= main_~sn~0 16) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (not (<= main_~sn~0 15)))))} is VALID [2022-04-28 02:44:00,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(or (<= main_~i~0 1) (and (<= main_~sn~0 16) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (not (<= main_~sn~0 15)))))} [45] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {258#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-28 02:44:00,348 INFO L272 TraceCheckUtils]: 8: Hoare triple {258#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:44:00,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {260#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:44:00,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {260#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {252#false} is VALID [2022-04-28 02:44:00,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-28 02:44:00,349 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-28 02:44:00,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:44:00,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549538456] [2022-04-28 02:44:00,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549538456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:00,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:00,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:44:00,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:44:00,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [45026357] [2022-04-28 02:44:00,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [45026357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:00,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:00,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:44:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233433700] [2022-04-28 02:44:00,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:44:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-28 02:44:00,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:44:00,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-28 02:44:00,457 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-28 02:44:00,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:44:00,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:44:00,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:44:00,457 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-28 02:44:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:00,641 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 02:44:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:44:00,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-28 02:44:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:44:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-28 02:44:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2022-04-28 02:44:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-28 02:44:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2022-04-28 02:44:00,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 14 transitions. [2022-04-28 02:44:00,657 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-28 02:44:00,657 INFO L225 Difference]: With dead ends: 14 [2022-04-28 02:44:00,657 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:44:00,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-28 02:44:00,658 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:44:00,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:44:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:44:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:44:00,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:44:00,659 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-28 02:44:00,659 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-28 02:44:00,660 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-28 02:44:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:00,660 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:44:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:44:00,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:00,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:00,660 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-28 02:44:00,660 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-28 02:44:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:00,660 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:44:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:44:00,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:00,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:00,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:44:00,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:44:00,661 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-28 02:44:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:44:00,661 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-28 02:44:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:44:00,661 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:44:00,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-28 02:44:00,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 02:44:00,661 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-28 02:44:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:44:00,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:00,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:44:00,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:44:00,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:44:00,741 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 02:44:00,741 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 02:44:00,741 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 02:44:00,741 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 28) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 28) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 24 26) the Hoare annotation is: (and (<= main_~i~0 8) (or (and (= main_~sn~0 (* main_~i~0 2)) (< 1 main_~i~0)) (and (= main_~i~0 1) (= (+ (- 2) main_~sn~0) 0)))) [2022-04-28 02:44:00,742 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: (or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 9) (or (and (< 2 main_~i~0) (= (+ 2 main_~sn~0) (* main_~i~0 2))) (and (= main_~i~0 2) (= 2 main_~sn~0))))) [2022-04-28 02:44:00,742 INFO L895 garLoopResultBuilder]: At program point L24-4(lines 24 26) the Hoare annotation is: (and (= (+ 2 main_~sn~0) (* main_~i~0 2)) (<= main_~i~0 9) (< 15 main_~sn~0)) [2022-04-28 02:44:00,742 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 28) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L895 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-28 02:44:00,742 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:44:00,742 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 02:44:00,742 INFO L895 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-28 02:44:00,743 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-28 02:44:00,743 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2022-04-28 02:44:00,743 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 19) the Hoare annotation is: true [2022-04-28 02:44:00,743 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 02:44:00,745 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-28 02:44:00,746 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:44:00,748 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:44:00,748 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:44:00,750 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 02:44:00,754 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:44:00,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:44:00 BoogieIcfgContainer [2022-04-28 02:44:00,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:44:00,760 INFO L158 Benchmark]: Toolchain (without parser) took 2912.21ms. Allocated memory was 190.8MB in the beginning and 249.6MB in the end (delta: 58.7MB). Free memory was 139.7MB in the beginning and 186.2MB in the end (delta: -46.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 02:44:00,760 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 155.9MB in the beginning and 155.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:44:00,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.23ms. Allocated memory was 190.8MB in the beginning and 249.6MB in the end (delta: 58.7MB). Free memory was 139.5MB in the beginning and 226.6MB in the end (delta: -87.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-28 02:44:00,761 INFO L158 Benchmark]: Boogie Preprocessor took 17.58ms. Allocated memory is still 249.6MB. Free memory was 226.6MB in the beginning and 225.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:44:00,761 INFO L158 Benchmark]: RCFGBuilder took 254.42ms. Allocated memory is still 249.6MB. Free memory was 225.4MB in the beginning and 214.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 02:44:00,761 INFO L158 Benchmark]: TraceAbstraction took 2420.91ms. Allocated memory is still 249.6MB. Free memory was 214.1MB in the beginning and 186.2MB in the end (delta: 27.8MB). Peak memory consumption was 27.6MB. Max. memory is 8.0GB. [2022-04-28 02:44:00,762 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 190.8MB. Free memory was 155.9MB in the beginning and 155.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.23ms. Allocated memory was 190.8MB in the beginning and 249.6MB in the end (delta: 58.7MB). Free memory was 139.5MB in the beginning and 226.6MB in the end (delta: -87.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.58ms. Allocated memory is still 249.6MB. Free memory was 226.6MB in the beginning and 225.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.42ms. Allocated memory is still 249.6MB. Free memory was 225.4MB in the beginning and 214.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2420.91ms. Allocated memory is still 249.6MB. Free memory was 214.1MB in the beginning and 186.2MB in the end (delta: 27.8MB). Peak memory consumption was 27.6MB. 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: 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 36 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 31 PreInvPairs, 41 NumberOfFragments, 101 HoareAnnotationTreeSize, 31 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (sn == 0 && i == 1) || (i <= 9 && ((2 < i && 2 + sn == i * 2) || (i == 2 && 2 == sn))) - ProcedureContractResult [Line: 22]: 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-28 02:44:00,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...