/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:34:56,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:34:56,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:34:56,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:34:56,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:34:56,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:34:56,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:34:56,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:34:56,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:34:56,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:34:56,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:34:56,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:34:56,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:34:56,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:34:56,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:34:56,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:34:56,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:34:56,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:34:56,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:34:56,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:34:56,400 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:34:56,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:34:56,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:34:56,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:34:56,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:34:56,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:34:56,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:34:56,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:34:56,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:34:56,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:34:56,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:34:56,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:34:56,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:34:56,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:34:56,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:34:56,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:34:56,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:34:56,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:34:56,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:34:56,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:34:56,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:34:56,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:34:56,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:34:56,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:34:56,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:34:56,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:34:56,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:34:56,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:34:56,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:34:56,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:34:56,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:34:56,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:34:56,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:34:56,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:34:56,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:34:56,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:34:56,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:34:56,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:34:56,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:34:56,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:34:56,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:34:56,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:34:56,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:34:56,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:34:56,434 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:34:56,434 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:34:56,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:34:56,434 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:34:56,435 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-08 03:34:56,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:34:56,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:34:56,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:34:56,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:34:56,706 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:34:56,707 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-08 03:34:56,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c0cd494/14f35456fb024847a078150a1cc3da30/FLAGd89c0a357 [2022-04-08 03:34:57,181 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:34:57,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-1.c [2022-04-08 03:34:57,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c0cd494/14f35456fb024847a078150a1cc3da30/FLAGd89c0a357 [2022-04-08 03:34:57,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c0cd494/14f35456fb024847a078150a1cc3da30 [2022-04-08 03:34:57,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:34:57,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:34:57,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:34:57,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:34:57,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:34:57,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51de042f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57, skipping insertion in model container [2022-04-08 03:34:57,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:34:57,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:34:57,771 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-08 03:34:57,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:34:57,825 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:34:57,839 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-08 03:34:57,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:34:57,868 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:34:57,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57 WrapperNode [2022-04-08 03:34:57,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:34:57,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:34:57,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:34:57,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:34:57,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:34:57,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:34:57,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:34:57,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:34:57,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:34:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:34:57,944 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-08 03:34:57,946 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-08 03:34:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:34:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:34:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:34:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:34:57,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:34:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:34:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:34:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:34:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:34:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:34:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:34:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:34:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 03:34:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:34:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:34:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:34:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:34:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:34:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:34:58,040 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:34:58,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:34:58,305 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:34:58,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:34:58,313 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:34:58,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:34:58 BoogieIcfgContainer [2022-04-08 03:34:58,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:34:58,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:34:58,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:34:58,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:34:58,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:34:57" (1/3) ... [2022-04-08 03:34:58,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2539e88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:34:58, skipping insertion in model container [2022-04-08 03:34:58,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (2/3) ... [2022-04-08 03:34:58,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2539e88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:34:58, skipping insertion in model container [2022-04-08 03:34:58,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:34:58" (3/3) ... [2022-04-08 03:34:58,337 INFO L111 eAbstractionObserver]: Analyzing ICFG array-1.c [2022-04-08 03:34:58,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:34:58,343 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:34:58,401 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:34:58,412 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-08 03:34:58,412 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:34:58,444 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-08 03:34:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:34:58,451 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:58,452 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:58,452 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 1 times [2022-04-08 03:34:58,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [160562651] [2022-04-08 03:34:58,479 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:34:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 2 times [2022-04-08 03:34:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:58,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957264471] [2022-04-08 03:34:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:58,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,755 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-08 03:34:58,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 03:34:58,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2022-04-08 03:34:58,758 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-08 03:34:58,758 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-08 03:34:58,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 03:34:58,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2022-04-08 03:34:58,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret10 := main(); {25#true} is VALID [2022-04-08 03:34:58,760 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 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 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-08 03:34:58,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 03:34:58,761 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-08 03:34:58,762 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-08 03:34:58,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 03:34:58,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 03:34:58,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 03:34:58,763 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-08 03:34:58,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:58,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957264471] [2022-04-08 03:34:58,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957264471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:34:58,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:58,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [160562651] [2022-04-08 03:34:58,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [160562651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:34:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422078335] [2022-04-08 03:34:58,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:58,779 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-08 03:34:58,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:58,784 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-08 03:34:58,808 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-08 03:34:58,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:34:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:34:58,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:34:58,836 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-08 03:34:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,962 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 03:34:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:34:58,963 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-08 03:34:58,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:34:58,965 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-08 03:34:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-08 03:34:58,980 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-08 03:34:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-08 03:34:58,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-08 03:34:59,060 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-08 03:34:59,068 INFO L225 Difference]: With dead ends: 35 [2022-04-08 03:34:59,068 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 03:34:59,073 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-08 03:34:59,079 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-08 03:34:59,081 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-08 03:34:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 03:34:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 03:34:59,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:34:59,112 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-08 03:34:59,113 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-08 03:34:59,113 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-08 03:34:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,116 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 03:34:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 03:34:59,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:59,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:59,121 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-08 03:34:59,122 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-08 03:34:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,125 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 03:34:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 03:34:59,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:59,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:59,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:34:59,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:34:59,127 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-08 03:34:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-08 03:34:59,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-08 03:34:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:34:59,131 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-08 03:34:59,133 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-08 03:34:59,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-08 03:34:59,165 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-08 03:34:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 03:34:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:34:59,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:59,166 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:59,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:34:59,166 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:59,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 1 times [2022-04-08 03:34:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:59,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106391214] [2022-04-08 03:34:59,168 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:34:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 2 times [2022-04-08 03:34:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:59,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104564208] [2022-04-08 03:34:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:59,278 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-08 03:34:59,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-08 03:34:59,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #44#return; {163#true} is VALID [2022-04-08 03:34:59,279 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-08 03:34:59,279 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-08 03:34:59,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-08 03:34:59,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #44#return; {163#true} is VALID [2022-04-08 03:34:59,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret10 := main(); {163#true} is VALID [2022-04-08 03:34:59,281 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 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 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) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:34:59,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#(and (= main_~j~0 0) (= main_~SIZE~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {164#false} is VALID [2022-04-08 03:34:59,282 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-08 03:34:59,283 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-08 03:34:59,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID [2022-04-08 03:34:59,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#false} assume 0 == ~cond; {164#false} is VALID [2022-04-08 03:34:59,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-08 03:34:59,283 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-08 03:34:59,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:59,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104564208] [2022-04-08 03:34:59,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104564208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:59,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:59,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:34:59,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:59,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106391214] [2022-04-08 03:34:59,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106391214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:59,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:59,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:34:59,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187414835] [2022-04-08 03:34:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:59,286 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-08 03:34:59,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:59,287 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-08 03:34:59,299 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-08 03:34:59,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:34:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:59,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:34:59,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:34:59,301 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-08 03:34:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,414 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 03:34:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:34:59,414 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-08 03:34:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:34:59,415 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-08 03:34:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-08 03:34:59,417 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-08 03:34:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-08 03:34:59,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-08 03:34:59,462 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-08 03:34:59,464 INFO L225 Difference]: With dead ends: 24 [2022-04-08 03:34:59,465 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 03:34:59,465 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-08 03:34:59,469 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-08 03:34:59,470 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-08 03:34:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 03:34:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-08 03:34:59,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:34:59,480 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-08 03:34:59,481 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-08 03:34:59,481 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-08 03:34:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,484 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 03:34:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 03:34:59,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:59,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:59,487 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-08 03:34:59,489 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-08 03:34:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,491 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 03:34:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 03:34:59,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:59,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:59,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:34:59,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:34:59,492 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-08 03:34:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-08 03:34:59,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-08 03:34:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:34:59,495 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-08 03:34:59,496 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-08 03:34:59,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-08 03:34:59,515 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-08 03:34:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-08 03:34:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:34:59,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:59,516 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:59,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:34:59,516 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 1 times [2022-04-08 03:34:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:59,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1487526148] [2022-04-08 03:34:59,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:34:59,566 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:34:59,566 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:34:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 2 times [2022-04-08 03:34:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:59,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841876122] [2022-04-08 03:34:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:00,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {303#(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-08 03:35:00,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} assume true; {290#true} is VALID [2022-04-08 03:35:00,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {290#true} {290#true} #44#return; {290#true} is VALID [2022-04-08 03:35:00,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {290#true} call ULTIMATE.init(); {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:00,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(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-08 03:35:00,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume true; {290#true} is VALID [2022-04-08 03:35:00,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {290#true} {290#true} #44#return; {290#true} is VALID [2022-04-08 03:35:00,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {290#true} call #t~ret10 := main(); {290#true} is VALID [2022-04-08 03:35:00,571 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 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {295#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (= |main_~#array~0.offset| 0) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (or (<= main_~SIZE~0 1) (not (<= main_~j~0 (+ 2147483647 (* 4294967296 (div main_~j~0 4294967296))))) (<= (+ (* main_~j~0 4) |main_~#array~0.offset|) (* 17179869184 (div main_~j~0 4294967296)))))} is VALID [2022-04-08 03:35:00,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (= |main_~#array~0.offset| 0) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (or (<= main_~SIZE~0 1) (not (<= main_~j~0 (+ 2147483647 (* 4294967296 (div main_~j~0 4294967296))))) (<= (+ (* main_~j~0 4) |main_~#array~0.offset|) (* 17179869184 (div main_~j~0 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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {296#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|) |main_~#array~0.offset|) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (= |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-08 03:35:00,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|) |main_~#array~0.offset|) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (= |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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {297#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (* 17179869184 (div main_~j~0 4294967296)) (* main_~j~0 4)) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-08 03:35:00,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (* 17179869184 (div main_~j~0 4294967296)) (* main_~j~0 4)) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= 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_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-08 03:35:00,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {299#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-08 03:35:00,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {299#(<= 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); {300#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-08 03:35:00,579 INFO L272 TraceCheckUtils]: 11: Hoare triple {300#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {301#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:00,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {302#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:00,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {302#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {291#false} is VALID [2022-04-08 03:35:00,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-04-08 03:35:00,582 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-08 03:35:00,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:00,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841876122] [2022-04-08 03:35:00,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841876122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:00,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048169787] [2022-04-08 03:35:00,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:00,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:00,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:00,591 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-08 03:35:00,614 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-08 03:35:00,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:00,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:00,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 03:35:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:00,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:00,819 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 0 case distinctions, treesize of input 50 treesize of output 45 [2022-04-08 03:35:00,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2022-04-08 03:35:01,026 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-08 03:35:01,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {290#true} call ULTIMATE.init(); {290#true} is VALID [2022-04-08 03:35:01,135 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-08 03:35:01,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume true; {290#true} is VALID [2022-04-08 03:35:01,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {290#true} {290#true} #44#return; {290#true} is VALID [2022-04-08 03:35:01,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {290#true} call #t~ret10 := main(); {290#true} is VALID [2022-04-08 03:35:01,137 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 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {322#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:01,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {322#(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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {322#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:01,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {329#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|))) (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:01,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {329#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|))) (= main_~j~0 0) (= main_~SIZE~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {333#(and (= main_~j~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:01,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#(and (= main_~j~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~SIZE~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {299#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-08 03:35:01,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {299#(<= 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); {300#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-08 03:35:01,146 INFO L272 TraceCheckUtils]: 11: Hoare triple {300#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {343#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:01,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {347#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:01,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {291#false} is VALID [2022-04-08 03:35:01,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-04-08 03:35:01,149 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-08 03:35:01,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:01,578 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 45 treesize of output 41 [2022-04-08 03:35:01,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:35:01,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:01,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 88 [2022-04-08 03:35:01,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:35:01,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2022-04-08 03:35:01,684 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-04-08 03:35:01,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2022-04-08 03:35:01,709 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-04-08 03:35:01,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 3 [2022-04-08 03:35:01,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-04-08 03:35:01,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {291#false} is VALID [2022-04-08 03:35:01,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {347#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:01,793 INFO L272 TraceCheckUtils]: 11: Hoare triple {300#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {343#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:01,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {299#(<= 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); {300#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-08 03:35:01,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#(or (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {299#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-08 03:35:01,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (<= 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; {369#(or (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-08 03:35:01,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(or (and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (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|))) (or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~j~0 4294967296) 2147483647))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {373#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-08 03:35:01,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {381#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= (* (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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {377#(or (and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (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|))) (or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~j~0 4294967296) 2147483647))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:35:01,804 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 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {381#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= (* (mod main_~j~0 4294967296) 4) 0))} is VALID [2022-04-08 03:35:01,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {290#true} call #t~ret10 := main(); {290#true} is VALID [2022-04-08 03:35:01,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {290#true} {290#true} #44#return; {290#true} is VALID [2022-04-08 03:35:01,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume true; {290#true} is VALID [2022-04-08 03:35:01,805 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-08 03:35:01,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {290#true} call ULTIMATE.init(); {290#true} is VALID [2022-04-08 03:35:01,805 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-08 03:35:01,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048169787] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:01,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:01,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 20 [2022-04-08 03:35:01,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:01,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1487526148] [2022-04-08 03:35:01,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1487526148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:01,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:01,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 03:35:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183540820] [2022-04-08 03:35:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:01,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-08 03:35:01,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:01,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-08 03:35:01,830 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-08 03:35:01,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 03:35:01,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:01,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 03:35:01,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:35:01,833 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-08 03:35:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:02,404 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 03:35:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:35:02,405 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-08 03:35:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-08 03:35:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-08 03:35:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-08 03:35:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-08 03:35:02,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2022-04-08 03:35:02,452 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-08 03:35:02,453 INFO L225 Difference]: With dead ends: 25 [2022-04-08 03:35:02,453 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 03:35:02,453 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-04-08 03:35:02,454 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:02,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 47 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:35:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 03:35:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 03:35:02,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:02,469 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-08 03:35:02,470 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-08 03:35:02,470 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-08 03:35:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:02,471 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 03:35:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 03:35:02,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:02,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:02,472 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-08 03:35:02,473 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-08 03:35:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:02,476 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 03:35:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 03:35:02,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:02,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:02,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:02,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:02,477 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-08 03:35:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-08 03:35:02,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-08 03:35:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:02,483 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-08 03:35:02,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-08 03:35:02,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-08 03:35:02,513 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-08 03:35:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 03:35:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 03:35:02,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:02,514 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:02,542 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-08 03:35:02,727 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-08 03:35:02,728 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:02,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:02,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1459665050, now seen corresponding path program 3 times [2022-04-08 03:35:02,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:02,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1276668703] [2022-04-08 03:35:02,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:02,741 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:02,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:02,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1459665050, now seen corresponding path program 4 times [2022-04-08 03:35:02,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:02,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764237222] [2022-04-08 03:35:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:02,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:02,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(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); {542#true} is VALID [2022-04-08 03:35:02,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 03:35:02,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #44#return; {542#true} is VALID [2022-04-08 03:35:02,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:02,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#(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); {542#true} is VALID [2022-04-08 03:35:02,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 03:35:02,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #44#return; {542#true} is VALID [2022-04-08 03:35:02,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret10 := main(); {542#true} is VALID [2022-04-08 03:35:02,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {547#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:02,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {547#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:02,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {547#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:02,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(and (= main_~j~0 0) (= main_~SIZE~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {548#(and (not (<= (+ (div main_~SIZE~0 4294967296) 1) (div main_~j~0 4294967296))) (<= 1 main_~j~0) (= (+ (- 1) main_~SIZE~0) 0))} is VALID [2022-04-08 03:35:02,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(and (not (<= (+ (div main_~SIZE~0 4294967296) 1) (div main_~j~0 4294967296))) (<= 1 main_~j~0) (= (+ (- 1) main_~SIZE~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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {543#false} is VALID [2022-04-08 03:35:02,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#false} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {543#false} is VALID [2022-04-08 03:35:02,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {543#false} is VALID [2022-04-08 03:35:02,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {543#false} is VALID [2022-04-08 03:35:02,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {543#false} is VALID [2022-04-08 03:35:02,954 INFO L272 TraceCheckUtils]: 14: Hoare triple {543#false} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {543#false} is VALID [2022-04-08 03:35:02,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {543#false} ~cond := #in~cond; {543#false} is VALID [2022-04-08 03:35:02,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {543#false} assume 0 == ~cond; {543#false} is VALID [2022-04-08 03:35:02,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-04-08 03:35:02,955 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-08 03:35:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:02,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764237222] [2022-04-08 03:35:02,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764237222] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:02,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145137538] [2022-04-08 03:35:02,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:02,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:02,957 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-08 03:35:02,981 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-08 03:35:03,015 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:03,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:03,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 03:35:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:03,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:03,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2022-04-08 03:35:03,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#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); {542#true} is VALID [2022-04-08 03:35:03,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 03:35:03,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #44#return; {542#true} is VALID [2022-04-08 03:35:03,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret10 := main(); {542#true} is VALID [2022-04-08 03:35:03,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {547#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:03,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {547#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:03,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {547#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:03,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(and (= main_~j~0 0) (= main_~SIZE~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {577#(and (= main_~j~0 1) (= main_~SIZE~0 1))} is VALID [2022-04-08 03:35:03,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {577#(and (= main_~j~0 1) (= 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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {543#false} is VALID [2022-04-08 03:35:03,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#false} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {543#false} is VALID [2022-04-08 03:35:03,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {543#false} is VALID [2022-04-08 03:35:03,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {543#false} is VALID [2022-04-08 03:35:03,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {543#false} is VALID [2022-04-08 03:35:03,126 INFO L272 TraceCheckUtils]: 14: Hoare triple {543#false} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {543#false} is VALID [2022-04-08 03:35:03,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {543#false} ~cond := #in~cond; {543#false} is VALID [2022-04-08 03:35:03,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {543#false} assume 0 == ~cond; {543#false} is VALID [2022-04-08 03:35:03,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-04-08 03:35:03,127 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-08 03:35:03,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:03,466 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 45 treesize of output 41 [2022-04-08 03:35:03,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:35:03,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:03,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 88 [2022-04-08 03:35:03,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:35:03,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2022-04-08 03:35:03,533 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-04-08 03:35:03,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2022-04-08 03:35:03,553 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-04-08 03:35:03,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 3 [2022-04-08 03:35:03,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-04-08 03:35:03,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {608#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {543#false} is VALID [2022-04-08 03:35:03,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {612#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {608#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:03,697 INFO L272 TraceCheckUtils]: 14: Hoare triple {616#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {612#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:03,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {620#(<= 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); {616#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-08 03:35:03,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {624#(or (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {620#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-08 03:35:03,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (<= 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; {624#(or (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-08 03:35:03,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {632#(or (and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (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|))) (or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~j~0 4294967296) 2147483647))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {628#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-08 03:35:03,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= (* (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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {632#(or (and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (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|))) (or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~j~0 4294967296) 2147483647))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:35:03,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {640#(or (= (* (mod (+ main_~j~0 1) 4294967296) 4) 0) (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296))))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {636#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= (* (mod main_~j~0 4294967296) 4) 0))} is VALID [2022-04-08 03:35:03,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {640#(or (= (* (mod (+ main_~j~0 1) 4294967296) 4) 0) (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296))))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {640#(or (= (* (mod (+ main_~j~0 1) 4294967296) 4) 0) (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296))))} is VALID [2022-04-08 03:35:03,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {640#(or (= (* (mod (+ main_~j~0 1) 4294967296) 4) 0) (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 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 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {640#(or (= (* (mod (+ main_~j~0 1) 4294967296) 4) 0) (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296))))} is VALID [2022-04-08 03:35:03,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {640#(or (= (* (mod (+ main_~j~0 1) 4294967296) 4) 0) (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296))))} is VALID [2022-04-08 03:35:03,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret10 := main(); {542#true} is VALID [2022-04-08 03:35:03,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #44#return; {542#true} is VALID [2022-04-08 03:35:03,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 03:35:03,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#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); {542#true} is VALID [2022-04-08 03:35:03,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2022-04-08 03:35:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:03,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145137538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:03,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:03,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 11] total 15 [2022-04-08 03:35:03,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:03,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1276668703] [2022-04-08 03:35:03,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1276668703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:03,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:03,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:35:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387734795] [2022-04-08 03:35:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:03,712 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-08 03:35:03,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:03,712 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-08 03:35:03,731 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-08 03:35:03,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:35:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:35:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:35:03,732 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-08 03:35:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:03,811 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 03:35:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:35:03,811 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-08 03:35:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:03,812 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-08 03:35:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-04-08 03:35:03,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-08 03:35:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-04-08 03:35:03,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-04-08 03:35:03,835 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-08 03:35:03,835 INFO L225 Difference]: With dead ends: 19 [2022-04-08 03:35:03,835 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:35:03,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:35:03,837 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-08 03:35:03,837 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-08 03:35:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:35:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:35:03,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:03,838 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-08 03:35:03,838 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-08 03:35:03,838 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-08 03:35:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:03,838 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:35:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:35:03,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:03,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:03,839 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-08 03:35:03,839 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-08 03:35:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:03,839 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:35:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:35:03,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:03,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:03,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:03,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:03,839 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-08 03:35:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:35:03,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-08 03:35:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:03,840 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:35:03,840 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-08 03:35:03,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:35:03,840 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-08 03:35:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:35:03,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:03,842 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:35:03,870 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-08 03:35:04,059 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-08 03:35:04,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:35:04,203 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 03:35:04,204 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 03:35:04,204 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 03:35:04,204 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 31) the Hoare annotation is: true [2022-04-08 03:35:04,204 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (div main_~SIZE~0 4294967296))) (and (<= main_~menor~0 |main_#t~mem9|) (<= main_~SIZE~0 (+ 2147483647 (* .cse0 4294967296))) (< 0 (+ .cse0 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))) [2022-04-08 03:35:04,204 INFO L885 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-08 03:35:04,204 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 31) the Hoare annotation is: true [2022-04-08 03:35:04,204 INFO L878 garLoopResultBuilder]: At program point L24(lines 24 25) the Hoare annotation is: (let ((.cse1 (* main_~j~0 4)) (.cse0 (div main_~j~0 4294967296))) (and (= (* 17179869184 .cse0) (+ .cse1 |main_~#array~0.offset|)) (= main_~j~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ .cse1 (* (- 17179869184) .cse0) |main_~#array~0.offset|))) (= main_~SIZE~0 1))) [2022-04-08 03:35:04,204 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= 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-08 03:35:04,205 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 26) the Hoare annotation is: (let ((.cse0 (= main_~SIZE~0 1))) (or (and (not (<= (+ (div main_~SIZE~0 4294967296) 1) (div main_~j~0 4294967296))) (<= 1 main_~j~0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) .cse0) (and (= |main_~#array~0.offset| 0) (= main_~j~0 0) .cse0))) [2022-04-08 03:35:04,205 INFO L878 garLoopResultBuilder]: At program point L21-4(lines 21 26) the Hoare annotation is: (let ((.cse0 (div main_~SIZE~0 4294967296))) (and (<= main_~SIZE~0 (+ 2147483647 (* .cse0 4294967296))) (< 0 (+ .cse0 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))) [2022-04-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 31) the Hoare annotation is: true [2022-04-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:35:04,205 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-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-08 03:35:04,205 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-08 03:35:04,206 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:35:04,206 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-08 03:35:04,206 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-08 03:35:04,206 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:35:04,209 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2] [2022-04-08 03:35:04,210 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:35:04,213 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:35:04,215 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 03:35:04,226 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-08 03:35:04,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:35:04 BoogieIcfgContainer [2022-04-08 03:35:04,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:35:04,236 INFO L158 Benchmark]: Toolchain (without parser) took 6640.21ms. Allocated memory was 170.9MB in the beginning and 224.4MB in the end (delta: 53.5MB). Free memory was 120.2MB in the beginning and 85.8MB in the end (delta: 34.5MB). Peak memory consumption was 88.2MB. Max. memory is 8.0GB. [2022-04-08 03:35:04,236 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 170.9MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:35:04,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.52ms. Allocated memory was 170.9MB in the beginning and 224.4MB in the end (delta: 53.5MB). Free memory was 120.1MB in the beginning and 201.8MB in the end (delta: -81.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-08 03:35:04,237 INFO L158 Benchmark]: Boogie Preprocessor took 40.64ms. Allocated memory is still 224.4MB. Free memory was 201.8MB in the beginning and 200.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:35:04,237 INFO L158 Benchmark]: RCFGBuilder took 403.52ms. Allocated memory is still 224.4MB. Free memory was 200.2MB in the beginning and 187.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 03:35:04,237 INFO L158 Benchmark]: TraceAbstraction took 5918.64ms. Allocated memory is still 224.4MB. Free memory was 187.2MB in the beginning and 85.8MB in the end (delta: 101.4MB). Peak memory consumption was 101.9MB. Max. memory is 8.0GB. [2022-04-08 03:35:04,238 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.24ms. Allocated memory is still 170.9MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.52ms. Allocated memory was 170.9MB in the beginning and 224.4MB in the end (delta: 53.5MB). Free memory was 120.1MB in the beginning and 201.8MB in the end (delta: -81.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.64ms. Allocated memory is still 224.4MB. Free memory was 201.8MB in the beginning and 200.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 403.52ms. Allocated memory is still 224.4MB. Free memory was 200.2MB in the beginning and 187.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5918.64ms. Allocated memory is still 224.4MB. Free memory was 187.2MB in the beginning and 85.8MB in the end (delta: 101.4MB). Peak memory consumption was 101.9MB. 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.8s, 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, 54 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 51 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s 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, 179 HoareAnnotationTreeSize, 40 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 90 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: (((!(SIZE / 4294967296 + 1 <= j / 4294967296) && 1 <= j) && menor <= unknown-#memory_int-unknown[array][array]) && SIZE == 1) || ((array == 0 && j == 0) && 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-08 03:35:04,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...