/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark32_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:40:38,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:40:38,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:40:38,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:40:38,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:40:38,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:40:38,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:40:38,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:40:38,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:40:38,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:40:38,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:40:38,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:40:38,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:40:38,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:40:38,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:40:38,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:40:38,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:40:38,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:40:38,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:40:38,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:40:38,943 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:40:38,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:40:38,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:40:38,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:40:38,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:40:38,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:40:38,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:40:38,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:40:38,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:40:38,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:40:38,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:40:38,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:40:38,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:40:38,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:40:38,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:40:38,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:40:38,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:40:38,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:40:38,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:40:38,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:40:38,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:40:38,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:40:38,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:40:38,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:40:38,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:40:38,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:40:38,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:40:38,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:40:38,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:40:38,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:40:38,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:40:38,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:40:38,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:40:38,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:40:38,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:40:38,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:40:38,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:40:38,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:40:38,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:40:38,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:40:38,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:40:38,981 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:40:38,981 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:40:38,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:40:38,982 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:40:38,982 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 10:40:39,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:40:39,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:40:39,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:40:39,267 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:40:39,268 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:40:39,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark32_linear.i [2022-04-28 10:40:39,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb19ea18/ed3aed2796a04e54a6d21b2f31165d31/FLAG03096c274 [2022-04-28 10:40:39,699 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:40:39,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark32_linear.i [2022-04-28 10:40:39,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb19ea18/ed3aed2796a04e54a6d21b2f31165d31/FLAG03096c274 [2022-04-28 10:40:40,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb19ea18/ed3aed2796a04e54a6d21b2f31165d31 [2022-04-28 10:40:40,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:40:40,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:40:40,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:40:40,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:40:40,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:40:40,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a426e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40, skipping insertion in model container [2022-04-28 10:40:40,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:40:40,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:40:40,299 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/benchmark32_linear.i[868,881] [2022-04-28 10:40:40,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:40:40,326 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:40:40,355 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/benchmark32_linear.i[868,881] [2022-04-28 10:40:40,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:40:40,373 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:40:40,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40 WrapperNode [2022-04-28 10:40:40,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:40:40,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:40:40,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:40:40,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:40:40,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:40:40,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:40:40,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:40:40,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:40:40,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (1/1) ... [2022-04-28 10:40:40,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:40:40,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:40,465 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 10:40:40,474 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 10:40:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:40:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:40:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:40:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:40:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:40:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:40:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:40:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:40:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:40:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:40:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:40:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:40:40,555 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:40:40,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:40:40,660 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:40:40,667 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:40:40,667 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:40:40,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:40:40 BoogieIcfgContainer [2022-04-28 10:40:40,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:40:40,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:40:40,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:40:40,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:40:40,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:40:40" (1/3) ... [2022-04-28 10:40:40,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344f5747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:40:40, skipping insertion in model container [2022-04-28 10:40:40,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:40" (2/3) ... [2022-04-28 10:40:40,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344f5747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:40:40, skipping insertion in model container [2022-04-28 10:40:40,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:40:40" (3/3) ... [2022-04-28 10:40:40,697 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark32_linear.i [2022-04-28 10:40:40,709 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:40:40,709 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:40:40,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:40:40,784 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@5a433fa0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@761cfd74 [2022-04-28 10:40:40,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:40:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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 10:40:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:40:40,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:40,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:40,812 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash -35238852, now seen corresponding path program 1 times [2022-04-28 10:40:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:40,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2107743257] [2022-04-28 10:40:40,847 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:40:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -35238852, now seen corresponding path program 2 times [2022-04-28 10:40:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:40,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294295042] [2022-04-28 10:40:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:40,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:41,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(21, 2); {25#true} is VALID [2022-04-28 10:40:41,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 10:40:41,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-28 10:40:41,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:41,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(21, 2); {25#true} is VALID [2022-04-28 10:40:41,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 10:40:41,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-28 10:40:41,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-28 10:40:41,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-28 10:40:41,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(1 == ~x~0 || 2 == ~x~0); {25#true} is VALID [2022-04-28 10:40:41,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 10:40:41,078 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~x~0 <= 8 then 1 else 0)); {26#false} is VALID [2022-04-28 10:40:41,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 10:40:41,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 10:40:41,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 10:40:41,080 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 10:40:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:41,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294295042] [2022-04-28 10:40:41,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294295042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:41,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:41,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:40:41,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:41,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2107743257] [2022-04-28 10:40:41,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2107743257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:41,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:41,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:40:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745998183] [2022-04-28 10:40:41,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:41,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 10:40:41,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:41,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 10:40:41,124 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-28 10:40:41,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:40:41,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:41,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:40:41,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:40:41,158 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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.6666666666666665) internal successors, (8), 2 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-28 10:40:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:41,261 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-28 10:40:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:40:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 10:40:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 10:40:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-28 10:40:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 10:40:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-28 10:40:41,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-28 10:40:41,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:41,350 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:40:41,350 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:40:41,353 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 10:40:41,359 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 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 10:40:41,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:40:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:40:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:40:41,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:41,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 10:40:41,385 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 10:40:41,385 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 10:40:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:41,388 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 10:40:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 10:40:41,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:41,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:41,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 10:40:41,389 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 10:40:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:41,391 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 10:40:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 10:40:41,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:41,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:41,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:41,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 10:40:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-28 10:40:41,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-04-28 10:40:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:41,396 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-28 10:40:41,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 10:40:41,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-28 10:40:41,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 10:40:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:40:41,417 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:41,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:41,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:40:41,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -49091667, now seen corresponding path program 1 times [2022-04-28 10:40:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:41,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2059349712] [2022-04-28 10:40:41,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:40:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash -49091667, now seen corresponding path program 2 times [2022-04-28 10:40:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:41,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053417420] [2022-04-28 10:40:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:41,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(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(21, 2); {161#true} is VALID [2022-04-28 10:40:41,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 10:40:41,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #56#return; {161#true} is VALID [2022-04-28 10:40:41,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:41,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(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(21, 2); {161#true} is VALID [2022-04-28 10:40:41,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 10:40:41,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #56#return; {161#true} is VALID [2022-04-28 10:40:41,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret3 := main(); {161#true} is VALID [2022-04-28 10:40:41,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {161#true} is VALID [2022-04-28 10:40:41,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume !!(1 == ~x~0 || 2 == ~x~0); {166#(<= main_~x~0 2)} is VALID [2022-04-28 10:40:41,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(<= main_~x~0 2)} assume !(0 != #t~nondet2 % 256);havoc #t~nondet2; {166#(<= main_~x~0 2)} is VALID [2022-04-28 10:40:41,516 INFO L272 TraceCheckUtils]: 8: Hoare triple {166#(<= main_~x~0 2)} call __VERIFIER_assert((if ~x~0 <= 8 then 1 else 0)); {167#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:40:41,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {168#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:40:41,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-28 10:40:41,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 10:40:41,517 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 10:40:41,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:41,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053417420] [2022-04-28 10:40:41,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053417420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:41,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:41,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:40:41,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2059349712] [2022-04-28 10:40:41,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2059349712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:41,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:41,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:40:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623319682] [2022-04-28 10:40:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-28 10:40:41,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:41,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-28 10:40:41,532 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-28 10:40:41,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:40:41,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:40:41,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:40:41,533 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-28 10:40:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:41,634 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 10:40:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:40:41,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-28 10:40:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-28 10:40:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 10:40:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-28 10:40:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 10:40:41,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-28 10:40:41,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:41,654 INFO L225 Difference]: With dead ends: 15 [2022-04-28 10:40:41,654 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:40:41,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:40:41,656 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:41,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:40:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:40:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:40:41,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:41,658 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 10:40:41,658 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 10:40:41,658 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 10:40:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:41,658 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:40:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:40:41,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:41,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:41,659 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 10:40:41,659 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 10:40:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:41,659 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:40:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:40:41,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:41,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:41,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:41,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:41,660 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 10:40:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:40:41,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-28 10:40:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:41,660 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:40:41,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-28 10:40:41,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:40:41,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 10:40:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:40:41,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:41,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:40:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:40:41,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:40:41,718 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-28 10:40:41,718 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-28 10:40:41,719 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-28 10:40:41,719 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 28) the Hoare annotation is: true [2022-04-28 10:40:41,719 INFO L895 garLoopResultBuilder]: At program point L23(lines 23 24) the Hoare annotation is: (<= main_~x~0 2) [2022-04-28 10:40:41,719 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 10:40:41,719 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 28) the Hoare annotation is: true [2022-04-28 10:40:41,719 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 28) the Hoare annotation is: true [2022-04-28 10:40:41,720 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-28 10:40:41,720 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (<= main_~x~0 2) [2022-04-28 10:40:41,720 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 22 25) the Hoare annotation is: (<= main_~x~0 2) [2022-04-28 10:40:41,720 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 25) the Hoare annotation is: (<= main_~x~0 2) [2022-04-28 10:40:41,720 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:40:41,720 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 10:40:41,720 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:40:41,721 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:40:41,721 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:40:41,721 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:40:41,721 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:40:41,721 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:40:41,721 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 10:40:41,721 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-28 10:40:41,721 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-28 10:40:41,722 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-28 10:40:41,722 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:40:41,725 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-28 10:40:41,727 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:40:41,730 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:40:41,731 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:40:41,732 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-28 10:40:41,738 INFO L163 areAnnotationChecker]: CFG has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:40:41,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:40:41 BoogieIcfgContainer [2022-04-28 10:40:41,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:40:41,746 INFO L158 Benchmark]: Toolchain (without parser) took 1625.70ms. Allocated memory is still 185.6MB. Free memory was 138.2MB in the beginning and 94.1MB in the end (delta: 44.1MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-04-28 10:40:41,747 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 185.6MB. Free memory was 154.2MB in the beginning and 154.1MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:40:41,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.28ms. Allocated memory is still 185.6MB. Free memory was 138.0MB in the beginning and 165.8MB in the end (delta: -27.8MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-28 10:40:41,748 INFO L158 Benchmark]: Boogie Preprocessor took 51.48ms. Allocated memory is still 185.6MB. Free memory was 165.4MB in the beginning and 164.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:40:41,748 INFO L158 Benchmark]: RCFGBuilder took 241.79ms. Allocated memory is still 185.6MB. Free memory was 164.1MB in the beginning and 153.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 10:40:41,748 INFO L158 Benchmark]: TraceAbstraction took 1075.36ms. Allocated memory is still 185.6MB. Free memory was 152.8MB in the beginning and 94.1MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-04-28 10:40:41,750 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.20ms. Allocated memory is still 185.6MB. Free memory was 154.2MB in the beginning and 154.1MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.28ms. Allocated memory is still 185.6MB. Free memory was 138.0MB in the beginning and 165.8MB in the end (delta: -27.8MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.48ms. Allocated memory is still 185.6MB. Free memory was 165.4MB in the beginning and 164.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 241.79ms. Allocated memory is still 185.6MB. Free memory was 164.1MB in the beginning and 153.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1075.36ms. Allocated memory is still 185.6MB. Free memory was 152.8MB in the beginning and 94.1MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 34 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 22 LocationsWithAnnotation, 28 PreInvPairs, 36 NumberOfFragments, 47 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 5 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: 22]: Loop Invariant Derived loop invariant: x <= 2 - 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-28 10:40:41,787 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...