/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/loops/array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:01:35,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:01:35,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:01:36,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:01:36,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:01:36,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:01:36,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:01:36,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:01:36,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:01:36,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:01:36,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:01:36,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:01:36,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:01:36,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:01:36,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:01:36,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:01:36,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:01:36,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:01:36,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:01:36,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:01:36,100 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:01:36,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:01:36,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:01:36,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:01:36,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:01:36,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:01:36,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:01:36,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:01:36,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:01:36,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:01:36,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:01:36,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:01:36,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:01:36,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:01:36,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:01:36,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:01:36,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:01:36,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:01:36,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:01:36,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:01:36,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:01:36,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:01:36,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:01:36,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:01:36,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:01:36,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:01:36,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:01:36,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:01:36,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:01:36,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:01:36,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:01:36,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:01:36,151 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:01:36,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:01:36,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:01:36,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:01:36,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:01:36,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:01:36,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:36,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:01:36,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:01:36,152 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:01:36,152 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:01:36,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:01:36,153 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:01:36,153 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:01:36,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:01:36,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:01:36,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:01:36,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:01:36,554 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:01:36,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array-1.c [2022-04-15 12:01:36,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc976a1c/ea3215ba80224e43a6dcb9ef67dac53b/FLAGbc5ba12f0 [2022-04-15 12:01:37,145 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:01:37,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-1.c [2022-04-15 12:01:37,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc976a1c/ea3215ba80224e43a6dcb9ef67dac53b/FLAGbc5ba12f0 [2022-04-15 12:01:37,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc976a1c/ea3215ba80224e43a6dcb9ef67dac53b [2022-04-15 12:01:37,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:01:37,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:01:37,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:37,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:01:37,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:01:37,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:37" (1/1) ... [2022-04-15 12:01:37,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5486f76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:37, skipping insertion in model container [2022-04-15 12:01:37,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:37" (1/1) ... [2022-04-15 12:01:37,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:01:37,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:01:37,932 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/array-1.c[319,332] [2022-04-15 12:01:37,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:38,004 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:01:38,017 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/array-1.c[319,332] [2022-04-15 12:01:38,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:38,059 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:01:38,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38 WrapperNode [2022-04-15 12:01:38,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:38,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:01:38,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:01:38,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:01:38,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (1/1) ... [2022-04-15 12:01:38,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (1/1) ... [2022-04-15 12:01:38,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (1/1) ... [2022-04-15 12:01:38,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (1/1) ... [2022-04-15 12:01:38,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (1/1) ... [2022-04-15 12:01:38,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (1/1) ... [2022-04-15 12:01:38,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (1/1) ... [2022-04-15 12:01:38,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:01:38,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:01:38,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:01:38,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:01:38,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (1/1) ... [2022-04-15 12:01:38,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:38,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:38,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:01:38,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:01:38,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:01:38,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:01:38,337 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:01:38,352 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:01:38,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:01:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:01:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:01:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:01:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:01:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:01:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:01:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:01:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:01:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:01:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:01:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:01:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:01:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:01:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:01:38,427 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:01:38,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:01:38,680 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:01:38,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:01:38,686 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:01:38,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:38 BoogieIcfgContainer [2022-04-15 12:01:38,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:01:38,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:01:38,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:01:38,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:01:38,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:01:37" (1/3) ... [2022-04-15 12:01:38,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bc501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:38, skipping insertion in model container [2022-04-15 12:01:38,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:38" (2/3) ... [2022-04-15 12:01:38,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bc501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:38, skipping insertion in model container [2022-04-15 12:01:38,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:38" (3/3) ... [2022-04-15 12:01:38,718 INFO L111 eAbstractionObserver]: Analyzing ICFG array-1.c [2022-04-15 12:01:38,721 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:01:38,722 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:01:38,800 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:01:38,805 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:01:38,806 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:01:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:01:38,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:38,843 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:38,843 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 1 times [2022-04-15 12:01:38,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:38,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [420203630] [2022-04-15 12:01:38,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:38,909 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 2 times [2022-04-15 12:01:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:38,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293346576] [2022-04-15 12:01:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:39,251 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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 12:01:39,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:01:39,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2022-04-15 12:01:39,255 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-15 12:01:39,255 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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 12:01:39,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:01:39,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2022-04-15 12:01:39,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret10 := main(); {25#true} is VALID [2022-04-15 12:01:39,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {25#true} is VALID [2022-04-15 12:01:39,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 12:01:39,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {26#false} is VALID [2022-04-15 12:01:39,258 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {26#false} is VALID [2022-04-15 12:01:39,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 12:01:39,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 12:01:39,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 12:01:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:39,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:39,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293346576] [2022-04-15 12:01:39,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293346576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:39,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:39,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:39,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:39,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [420203630] [2022-04-15 12:01:39,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [420203630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:39,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:39,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937167994] [2022-04-15 12:01:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:39,285 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-15 12:01:39,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:39,289 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-15 12:01:39,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:39,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:01:39,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:01:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:39,383 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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-15 12:01:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,530 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 12:01:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:01:39,531 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-15 12:01:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:39,532 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-15 12:01:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 12:01:39,558 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-15 12:01:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 12:01:39,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-15 12:01:39,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:39,660 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:01:39,661 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:01:39,664 INFO L912 BasicCegarLoop]: 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-15 12:01:39,667 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 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-15 12:01:39,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:01:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:01:39,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:39,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,732 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,732 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,742 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:01:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:01:39,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:39,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:39,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-15 12:01:39,743 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-15 12:01:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,747 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:01:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:01:39,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:39,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:39,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:39,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 12:01:39,750 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-15 12:01:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:39,751 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 12:01:39,767 INFO L479 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-15 12:01:39,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 12:01:39,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:01:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:01:39,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:39,792 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:39,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:01:39,798 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 1 times [2022-04-15 12:01:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:39,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365222419] [2022-04-15 12:01:39,818 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 2 times [2022-04-15 12:01:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:39,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780541481] [2022-04-15 12:01:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,083 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(10, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID [2022-04-15 12:01:40,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-15 12:01:40,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #44#return; {163#true} is VALID [2022-04-15 12:01:40,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:40,087 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(10, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID [2022-04-15 12:01:40,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-15 12:01:40,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #44#return; {163#true} is VALID [2022-04-15 12:01:40,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret10 := main(); {163#true} is VALID [2022-04-15 12:01:40,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {168#(and (= main_~j~0 0) (<= 1 main_~SIZE~0) (<= (div main_~SIZE~0 4294967296) 0))} is VALID [2022-04-15 12:01:40,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#(and (= main_~j~0 0) (<= 1 main_~SIZE~0) (<= (div main_~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {164#false} is VALID [2022-04-15 12:01:40,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {164#false} is VALID [2022-04-15 12:01:40,092 INFO L272 TraceCheckUtils]: 8: Hoare triple {164#false} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {164#false} is VALID [2022-04-15 12:01:40,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID [2022-04-15 12:01:40,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#false} assume 0 == ~cond; {164#false} is VALID [2022-04-15 12:01:40,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-15 12:01:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:40,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:40,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780541481] [2022-04-15 12:01:40,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780541481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:40,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:40,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:40,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365222419] [2022-04-15 12:01:40,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365222419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:40,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:40,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:40,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573007206] [2022-04-15 12:01:40,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:40,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:01:40,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:40,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:40,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:01:40,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:01:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:01:40,109 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:40,212 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:01:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:01:40,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:01:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:01:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:01:40,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 12:01:40,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:40,341 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:01:40,341 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:01:40,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:40,359 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:40,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:01:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-15 12:01:40,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:40,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-15 12:01:40,376 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-15 12:01:40,376 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-15 12:01:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:40,378 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:01:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:01:40,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:40,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:40,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 18 states. [2022-04-15 12:01:40,399 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 18 states. [2022-04-15 12:01:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:40,412 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:01:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:01:40,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:40,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:40,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:40,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-15 12:01:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 12:01:40,415 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-15 12:01:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:40,415 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 12:01:40,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 12:01:40,436 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-15 12:01:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 12:01:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:01:40,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:40,437 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:40,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:01:40,438 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:40,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 1 times [2022-04-15 12:01:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:40,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950228716] [2022-04-15 12:01:40,464 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:40,465 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 2 times [2022-04-15 12:01:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:40,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561131870] [2022-04-15 12:01:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(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);call #Ultimate.allocInit(12, 3); {290#true} is VALID [2022-04-15 12:01:40,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} assume true; {290#true} is VALID [2022-04-15 12:01:40,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {290#true} {290#true} #44#return; {290#true} is VALID [2022-04-15 12:01:40,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {290#true} call ULTIMATE.init(); {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:40,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#(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);call #Ultimate.allocInit(12, 3); {290#true} is VALID [2022-04-15 12:01:40,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume true; {290#true} is VALID [2022-04-15 12:01:40,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {290#true} {290#true} #44#return; {290#true} is VALID [2022-04-15 12:01:40,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {290#true} call #t~ret10 := main(); {290#true} is VALID [2022-04-15 12:01:40,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {295#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 12:01:40,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {296#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))))} is VALID [2022-04-15 12:01:40,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {297#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-15 12:01:40,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {298#(and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-15 12:01:40,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {298#(and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-15 12:01:40,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {298#(and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {299#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-15 12:01:40,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {299#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {300#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:01:40,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {301#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:01:40,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {301#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {291#false} is VALID [2022-04-15 12:01:40,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-04-15 12:01:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:40,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:40,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561131870] [2022-04-15 12:01:40,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561131870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:40,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611163078] [2022-04-15 12:01:40,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:40,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:40,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:01:41,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:41,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:41,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:01:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:41,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:41,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-04-15 12:01:41,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-15 12:01:41,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {290#true} call ULTIMATE.init(); {290#true} is VALID [2022-04-15 12:01:41,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} #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);call #Ultimate.allocInit(12, 3); {290#true} is VALID [2022-04-15 12:01:41,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume true; {290#true} is VALID [2022-04-15 12:01:41,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {290#true} {290#true} #44#return; {290#true} is VALID [2022-04-15 12:01:41,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {290#true} call #t~ret10 := main(); {290#true} is VALID [2022-04-15 12:01:41,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {321#(= main_~j~0 0)} is VALID [2022-04-15 12:01:41,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {321#(= main_~j~0 0)} is VALID [2022-04-15 12:01:41,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {321#(= main_~j~0 0)} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:41,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:41,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:41,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {299#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-15 12:01:41,362 INFO L272 TraceCheckUtils]: 11: Hoare triple {299#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:41,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:41,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {291#false} is VALID [2022-04-15 12:01:41,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-04-15 12:01:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:41,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:41,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-04-15 12:01:41,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-04-15 12:01:41,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-04-15 12:01:41,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {291#false} is VALID [2022-04-15 12:01:41,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:41,701 INFO L272 TraceCheckUtils]: 11: Hoare triple {299#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:41,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {299#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-15 12:01:41,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:41,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:41,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {328#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:41,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#(= (* (mod main_~j~0 4294967296) 4) 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {373#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:41,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {377#(= (* (mod main_~j~0 4294967296) 4) 0)} is VALID [2022-04-15 12:01:41,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {290#true} call #t~ret10 := main(); {290#true} is VALID [2022-04-15 12:01:41,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {290#true} {290#true} #44#return; {290#true} is VALID [2022-04-15 12:01:41,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume true; {290#true} is VALID [2022-04-15 12:01:41,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} #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);call #Ultimate.allocInit(12, 3); {290#true} is VALID [2022-04-15 12:01:41,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {290#true} call ULTIMATE.init(); {290#true} is VALID [2022-04-15 12:01:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:41,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611163078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:41,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:41,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 16 [2022-04-15 12:01:41,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:41,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950228716] [2022-04-15 12:01:41,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950228716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:41,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:41,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:01:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554618502] [2022-04-15 12:01:41,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-15 12:01:41,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:41,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:41,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:01:41,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:01:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:01:41,747 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,237 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:01:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:01:42,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-15 12:01:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-15 12:01:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-15 12:01:42,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2022-04-15 12:01:42,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,273 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:01:42,274 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:01:42,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:01:42,275 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:42,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 44 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:01:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:01:42,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:42,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,288 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,288 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,289 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:01:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:01:42,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:42,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:42,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 19 states. [2022-04-15 12:01:42,290 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 19 states. [2022-04-15 12:01:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,291 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:01:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:01:42,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:42,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:42,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:42,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 12:01:42,293 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 12:01:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:42,293 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 12:01:42,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 12:01:42,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:01:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:01:42,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:42,315 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:42,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:42,529 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:42,529 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1459665050, now seen corresponding path program 3 times [2022-04-15 12:01:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:42,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675702199] [2022-04-15 12:01:42,544 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:42,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1459665050, now seen corresponding path program 4 times [2022-04-15 12:01:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:42,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222572250] [2022-04-15 12:01:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:42,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#(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);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-15 12:01:42,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 12:01:42,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #44#return; {538#true} is VALID [2022-04-15 12:01:42,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:42,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#(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);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-15 12:01:42,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 12:01:42,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #44#return; {538#true} is VALID [2022-04-15 12:01:42,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret10 := main(); {538#true} is VALID [2022-04-15 12:01:42,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {543#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 12:01:42,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#(and (= main_~j~0 0) (= main_~SIZE~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {543#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 12:01:42,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {543#(and (= main_~j~0 0) (= main_~SIZE~0 1))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {543#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 12:01:42,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(and (= main_~j~0 0) (= main_~SIZE~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {544#(and (<= 1 main_~j~0) (= (+ (- 1) main_~SIZE~0) 0) (<= (+ main_~SIZE~0 main_~j~0) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 12:01:42,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(and (<= 1 main_~j~0) (= (+ (- 1) main_~SIZE~0) 0) (<= (+ main_~SIZE~0 main_~j~0) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {539#false} is VALID [2022-04-15 12:01:42,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#false} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {539#false} is VALID [2022-04-15 12:01:42,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {539#false} is VALID [2022-04-15 12:01:42,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {539#false} is VALID [2022-04-15 12:01:42,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {539#false} is VALID [2022-04-15 12:01:42,730 INFO L272 TraceCheckUtils]: 14: Hoare triple {539#false} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {539#false} is VALID [2022-04-15 12:01:42,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2022-04-15 12:01:42,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2022-04-15 12:01:42,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 12:01:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:42,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:42,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222572250] [2022-04-15 12:01:42,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222572250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:42,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066132476] [2022-04-15 12:01:42,731 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:42,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:42,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:01:42,805 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:42,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:42,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:01:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:42,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-04-15 12:01:42,921 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-04-15 12:01:42,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-04-15 12:01:43,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-15 12:01:43,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 12:01:43,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} #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);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-15 12:01:43,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 12:01:43,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #44#return; {538#true} is VALID [2022-04-15 12:01:43,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret10 := main(); {538#true} is VALID [2022-04-15 12:01:43,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {564#(= main_~j~0 0)} is VALID [2022-04-15 12:01:43,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {564#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {564#(= main_~j~0 0)} is VALID [2022-04-15 12:01:43,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {564#(= main_~j~0 0)} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {578#(and (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) |main_#t~mem7|) (or (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= (* (mod main_~j~0 4294967296) 4) 0)))} is VALID [2022-04-15 12:01:43,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {578#(and (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) |main_#t~mem7|) (or (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= (* (mod main_~j~0 4294967296) 4) 0)))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {591#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-15 12:01:43,330 INFO L272 TraceCheckUtils]: 14: Hoare triple {591#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:43,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:43,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-15 12:01:43,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 12:01:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:01:43,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:43,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-04-15 12:01:43,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-04-15 12:01:43,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 12:01:43,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-15 12:01:43,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:43,708 INFO L272 TraceCheckUtils]: 14: Hoare triple {591#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:43,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {591#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-15 12:01:43,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {627#(or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (not (<= |main_#t~mem7| main_~menor~0)))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {627#(or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (not (<= |main_#t~mem7| main_~menor~0)))} is VALID [2022-04-15 12:01:43,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {637#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {571#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#(= (* (mod main_~j~0 4294967296) 4) 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~j~0 % 4294967296), 4); {637#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 12:01:43,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {641#(= (* (mod main_~j~0 4294967296) 4) 0)} is VALID [2022-04-15 12:01:43,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret10 := main(); {538#true} is VALID [2022-04-15 12:01:43,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #44#return; {538#true} is VALID [2022-04-15 12:01:43,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 12:01:43,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} #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);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-15 12:01:43,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 12:01:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:01:43,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066132476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:43,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:43,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 14 [2022-04-15 12:01:43,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:43,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675702199] [2022-04-15 12:01:43,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675702199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:43,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:43,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228232632] [2022-04-15 12:01:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:43,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:01:43,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:43,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:01:43,741 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,812 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:01:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:43,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:01:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-04-15 12:01:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-04-15 12:01:43,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-04-15 12:01:43,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,834 INFO L225 Difference]: With dead ends: 19 [2022-04-15 12:01:43,834 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:01:43,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:01:43,838 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:43,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:01:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:01:43,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:43,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:01:43,840 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:01:43,840 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:01:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,840 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:01:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:43,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:43,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:01:43,841 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:01:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,841 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:01:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:43,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:43,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:43,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:01:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:01:43,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-15 12:01:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:43,842 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:01:43,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:01:43,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:43,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,845 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:01:43,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:44,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 12:01:44,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:01:44,175 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:01:44,177 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:01:44,178 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:01:44,178 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 31) the Hoare annotation is: true [2022-04-15 12:01:44,178 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (<= main_~menor~0 |main_#t~mem9|) (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) [2022-04-15 12:01:44,178 INFO L885 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-15 12:01:44,179 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 31) the Hoare annotation is: true [2022-04-15 12:01:44,179 INFO L878 garLoopResultBuilder]: At program point L24(lines 24 25) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (= main_~SIZE~0 1)) [2022-04-15 12:01:44,180 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~SIZE~0 1)) [2022-04-15 12:01:44,180 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 26) the Hoare annotation is: (let ((.cse0 (= |main_~#array~0.offset| 0)) (.cse1 (= main_~SIZE~0 1))) (or (and .cse0 (= main_~j~0 0) .cse1) (and .cse0 (<= 1 main_~j~0) (<= (+ main_~SIZE~0 main_~j~0) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) .cse1))) [2022-04-15 12:01:44,180 INFO L878 garLoopResultBuilder]: At program point L21-4(lines 21 26) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) [2022-04-15 12:01:44,181 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 31) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:01:44,182 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-15 12:01:44,182 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:01:44,183 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:01:44,183 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-15 12:01:44,183 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:01:44,186 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2] [2022-04-15 12:01:44,187 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:01:44,192 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:01:44,194 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:01:44,204 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:01:44,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:01:44 BoogieIcfgContainer [2022-04-15 12:01:44,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:01:44,214 INFO L158 Benchmark]: Toolchain (without parser) took 6641.72ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 129.8MB in the beginning and 92.5MB in the end (delta: 37.3MB). Peak memory consumption was 76.4MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,214 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 185.6MB. Free memory was 146.4MB in the beginning and 146.3MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:01:44,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.88ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 129.6MB in the beginning and 195.4MB in the end (delta: -65.9MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,215 INFO L158 Benchmark]: Boogie Preprocessor took 77.51ms. Allocated memory is still 223.3MB. Free memory was 195.4MB in the beginning and 193.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,215 INFO L158 Benchmark]: RCFGBuilder took 525.29ms. Allocated memory is still 223.3MB. Free memory was 193.4MB in the beginning and 181.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,216 INFO L158 Benchmark]: TraceAbstraction took 5524.32ms. Allocated memory is still 223.3MB. Free memory was 181.3MB in the beginning and 92.5MB in the end (delta: 88.8MB). Peak memory consumption was 89.8MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,217 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.26ms. Allocated memory is still 185.6MB. Free memory was 146.4MB in the beginning and 146.3MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 476.88ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 129.6MB in the beginning and 195.4MB in the end (delta: -65.9MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.51ms. Allocated memory is still 223.3MB. Free memory was 195.4MB in the beginning and 193.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 525.29ms. Allocated memory is still 223.3MB. Free memory was 193.4MB in the beginning and 181.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5524.32ms. Allocated memory is still 223.3MB. Free memory was 181.3MB in the beginning and 92.5MB in the end (delta: 88.8MB). Peak memory consumption was 89.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: 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: 5.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 52 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 40 PreInvPairs, 57 NumberOfFragments, 141 HoareAnnotationTreeSize, 40 FomulaSimplifications, 5 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 10 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: 21]: Loop Invariant Derived loop invariant: ((array == 0 && j == 0) && SIZE == 1) || ((((array == 0 && 1 <= j) && SIZE + j <= SIZE / 4294967296 * 4294967296 + 4294967296) && menor <= unknown-#memory_int-unknown[array][array]) && SIZE == 1) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 12:01:44,253 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...